{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RJIIF2U7YRRSKUBROG5MDHZRGH","short_pith_number":"pith:RJIIF2U7","canonical_record":{"source":{"id":"1202.0959","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-05T12:46:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f59d5c7564ad34cbb3eb71b6bd20415a13ef5233d6ee58a51d80c6cc808dc084","abstract_canon_sha256":"4c4445272799f56d98087ea811cc1565c26d4c26a0c5d0484af04f1c0213f492"},"schema_version":"1.0"},"canonical_sha256":"8a5082ea9fc46325503171bac19f3131d2f716703fe06930d044470efe051add","source":{"kind":"arxiv","id":"1202.0959","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0959","created_at":"2026-05-18T04:02:53Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0959v2","created_at":"2026-05-18T04:02:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0959","created_at":"2026-05-18T04:02:53Z"},{"alias_kind":"pith_short_12","alias_value":"RJIIF2U7YRRS","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RJIIF2U7YRRSKUBR","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RJIIF2U7","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RJIIF2U7YRRSKUBROG5MDHZRGH","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0959","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-05T12:46:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f59d5c7564ad34cbb3eb71b6bd20415a13ef5233d6ee58a51d80c6cc808dc084","abstract_canon_sha256":"4c4445272799f56d98087ea811cc1565c26d4c26a0c5d0484af04f1c0213f492"},"schema_version":"1.0"},"canonical_sha256":"8a5082ea9fc46325503171bac19f3131d2f716703fe06930d044470efe051add","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:53.881520Z","signature_b64":"J1FEXB+idE7ItiFvoYRJLpxgwjhX2rnIDxlENx2L0G8GNJAN8VSHBpI37NwpTXjyHcu1QnEVU/Saw6esyMBOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a5082ea9fc46325503171bac19f3131d2f716703fe06930d044470efe051add","last_reissued_at":"2026-05-18T04:02:53.880713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:53.880713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0959","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-18T04:02:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SWv3Tb0fxoHDNEQJH0z+mB03QDD9QUZKtRYt+qFxcYsxRuSTkRWk9TJEjVDW8yE2jFG9NrYUh72FQmgNlf6uBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:42:03.608072Z"},"content_sha256":"13e50313a8318f452f6bddc82e704b29158e53cd8518c6f8c3c1e7e414660aa6","schema_version":"1.0","event_id":"sha256:13e50313a8318f452f6bddc82e704b29158e53cd8518c6f8c3c1e7e414660aa6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RJIIF2U7YRRSKUBROG5MDHZRGH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Random Coding Technique that Generalizes Superposition Coding and Binning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Stefano Rini","submitted_at":"2012-02-05T12:46:39Z","abstract_excerpt":"Proving capacity for networks without feedback or cooperation usually involves two fundamental random coding techniques: superposition coding and binning. Although conceptually very different, these two techniques often achieve the same performance, suggesting an underlying similarity. In this correspondence we propose a new random coding technique that generalizes superposition coding and binning and provides new insight on relationship among the two With this new theoretical tool, we derive new achievable regions for three classical information theoretical models: multi-access channel, broad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0959","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-18T04:02:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WQyRBW3dMHk8fgccY4dndWya0n10BIvgwJteSa6Zx7x2ZNYoY7H6rYReUDDWHxa4YzBMZYZPrLHfIdqN4dXiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:42:03.608468Z"},"content_sha256":"be47cf13b08b6f8191c681413c7aaf8b0401af3907c098b4c9a0e0c5cb65ac7e","schema_version":"1.0","event_id":"sha256:be47cf13b08b6f8191c681413c7aaf8b0401af3907c098b4c9a0e0c5cb65ac7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RJIIF2U7YRRSKUBROG5MDHZRGH/bundle.json","state_url":"https://pith.science/pith/RJIIF2U7YRRSKUBROG5MDHZRGH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RJIIF2U7YRRSKUBROG5MDHZRGH/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-06T08:42:03Z","links":{"resolver":"https://pith.science/pith/RJIIF2U7YRRSKUBROG5MDHZRGH","bundle":"https://pith.science/pith/RJIIF2U7YRRSKUBROG5MDHZRGH/bundle.json","state":"https://pith.science/pith/RJIIF2U7YRRSKUBROG5MDHZRGH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RJIIF2U7YRRSKUBROG5MDHZRGH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RJIIF2U7YRRSKUBROG5MDHZRGH","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":"4c4445272799f56d98087ea811cc1565c26d4c26a0c5d0484af04f1c0213f492","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-05T12:46:39Z","title_canon_sha256":"f59d5c7564ad34cbb3eb71b6bd20415a13ef5233d6ee58a51d80c6cc808dc084"},"schema_version":"1.0","source":{"id":"1202.0959","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0959","created_at":"2026-05-18T04:02:53Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0959v2","created_at":"2026-05-18T04:02:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0959","created_at":"2026-05-18T04:02:53Z"},{"alias_kind":"pith_short_12","alias_value":"RJIIF2U7YRRS","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RJIIF2U7YRRSKUBR","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RJIIF2U7","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:be47cf13b08b6f8191c681413c7aaf8b0401af3907c098b4c9a0e0c5cb65ac7e","target":"graph","created_at":"2026-05-18T04:02:53Z","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":"Proving capacity for networks without feedback or cooperation usually involves two fundamental random coding techniques: superposition coding and binning. Although conceptually very different, these two techniques often achieve the same performance, suggesting an underlying similarity. In this correspondence we propose a new random coding technique that generalizes superposition coding and binning and provides new insight on relationship among the two With this new theoretical tool, we derive new achievable regions for three classical information theoretical models: multi-access channel, broad","authors_text":"Stefano Rini","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-05T12:46:39Z","title":"A New Random Coding Technique that Generalizes Superposition Coding and Binning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0959","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:13e50313a8318f452f6bddc82e704b29158e53cd8518c6f8c3c1e7e414660aa6","target":"record","created_at":"2026-05-18T04:02:53Z","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":"4c4445272799f56d98087ea811cc1565c26d4c26a0c5d0484af04f1c0213f492","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-05T12:46:39Z","title_canon_sha256":"f59d5c7564ad34cbb3eb71b6bd20415a13ef5233d6ee58a51d80c6cc808dc084"},"schema_version":"1.0","source":{"id":"1202.0959","kind":"arxiv","version":2}},"canonical_sha256":"8a5082ea9fc46325503171bac19f3131d2f716703fe06930d044470efe051add","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a5082ea9fc46325503171bac19f3131d2f716703fe06930d044470efe051add","first_computed_at":"2026-05-18T04:02:53.880713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:53.880713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J1FEXB+idE7ItiFvoYRJLpxgwjhX2rnIDxlENx2L0G8GNJAN8VSHBpI37NwpTXjyHcu1QnEVU/Saw6esyMBOCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:53.881520Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0959","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13e50313a8318f452f6bddc82e704b29158e53cd8518c6f8c3c1e7e414660aa6","sha256:be47cf13b08b6f8191c681413c7aaf8b0401af3907c098b4c9a0e0c5cb65ac7e"],"state_sha256":"fb6e9ade8d941e081f1bd5d74794ef414b771af775d46d5dfbd51985390ceb46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f7NCZpLzo659vG0y/0wCyCUB45GHpuIoXPT8Stn9zRoRI9VuGKkzbj0oVcAVM+33ob1SbcwkGYeMfgZXu84sDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:42:03.611917Z","bundle_sha256":"9cc8db5dea41b4796307827a4103d671f2f47989a9be45441949e620dddc8f31"}}