{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6IMOXWTBZZT7R7JUZNNUVEFXFE","short_pith_number":"pith:6IMOXWTB","canonical_record":{"source":{"id":"1112.1497","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T08:41:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"841a9333c6cac6f7366938a72d4582b84ffc2e75d120ccfdf7177dfecd13221b","abstract_canon_sha256":"2d4d97b99c58665ad7ab855724873b804f2e03e72fc26f7dd6ec019d65c15b00"},"schema_version":"1.0"},"canonical_sha256":"f218ebda61ce67f8fd34cb5b4a90b7291ad806a98abb84ee3fa0aa9b48de499a","source":{"kind":"arxiv","id":"1112.1497","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1497","created_at":"2026-05-18T01:12:19Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1497v3","created_at":"2026-05-18T01:12:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1497","created_at":"2026-05-18T01:12:19Z"},{"alias_kind":"pith_short_12","alias_value":"6IMOXWTBZZT7","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6IMOXWTBZZT7R7JU","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6IMOXWTB","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6IMOXWTBZZT7R7JUZNNUVEFXFE","target":"record","payload":{"canonical_record":{"source":{"id":"1112.1497","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T08:41:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"841a9333c6cac6f7366938a72d4582b84ffc2e75d120ccfdf7177dfecd13221b","abstract_canon_sha256":"2d4d97b99c58665ad7ab855724873b804f2e03e72fc26f7dd6ec019d65c15b00"},"schema_version":"1.0"},"canonical_sha256":"f218ebda61ce67f8fd34cb5b4a90b7291ad806a98abb84ee3fa0aa9b48de499a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:19.252135Z","signature_b64":"fg3kco9PNG8kdq7c1QYETljB3sWaGGPTvj7opZ5sLf/MIpoZ3BgF0HRl+XS2ANJLUqd2IjJpYt5sOJ3nhldtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f218ebda61ce67f8fd34cb5b4a90b7291ad806a98abb84ee3fa0aa9b48de499a","last_reissued_at":"2026-05-18T01:12:19.251794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:19.251794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.1497","source_version":3,"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-18T01:12:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"55p8nuXdcqHXaJUBjAidrQaUrfgMfWGnKwuw8/Qp2fmAdKyVJVHSWM+osGXrb/suIp6iUYCDkHX8cl8NCL2RBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:56:52.561260Z"},"content_sha256":"2f12a97321e9e9a589e2144b902cb21c06860843e2ff464716659248a174587c","schema_version":"1.0","event_id":"sha256:2f12a97321e9e9a589e2144b902cb21c06860843e2ff464716659248a174587c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6IMOXWTBZZT7R7JUZNNUVEFXFE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A unified graphical approach to random coding for multi-terminal networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrea Goldsmith, Stefano Rini","submitted_at":"2011-12-07T08:41:31Z","abstract_excerpt":"A unified graphical approach to random coding for any memoryless, single-hop, K-user channel with or without common information is defined through two steps. The first step is user virtualization: each user is divided into multiple virtual sub-users according to a chosen rate-splitting strategy. This results in an enhanced channel with a possibly larger number of users for which more coding possibilities are available and for which common messages to any subset of users can be encoded. Following user virtualization, the message of each user in the enhanced model is coded using a chosen combina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1497","kind":"arxiv","version":3},"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-18T01:12:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cSSUgecnHGKJs7zAXIFQsQsn1UZ0YB4JKwP+WEUuwBTRmTKIhnfCM8F0IVzCQlgBuV7Y8dTJm6gwwAChcP1EDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:56:52.561815Z"},"content_sha256":"43f79b8398408e896f9f424430fddef83507fe424811b51dd69900d93fb19738","schema_version":"1.0","event_id":"sha256:43f79b8398408e896f9f424430fddef83507fe424811b51dd69900d93fb19738"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6IMOXWTBZZT7R7JUZNNUVEFXFE/bundle.json","state_url":"https://pith.science/pith/6IMOXWTBZZT7R7JUZNNUVEFXFE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6IMOXWTBZZT7R7JUZNNUVEFXFE/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-06T00:56:52Z","links":{"resolver":"https://pith.science/pith/6IMOXWTBZZT7R7JUZNNUVEFXFE","bundle":"https://pith.science/pith/6IMOXWTBZZT7R7JUZNNUVEFXFE/bundle.json","state":"https://pith.science/pith/6IMOXWTBZZT7R7JUZNNUVEFXFE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6IMOXWTBZZT7R7JUZNNUVEFXFE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6IMOXWTBZZT7R7JUZNNUVEFXFE","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":"2d4d97b99c58665ad7ab855724873b804f2e03e72fc26f7dd6ec019d65c15b00","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T08:41:31Z","title_canon_sha256":"841a9333c6cac6f7366938a72d4582b84ffc2e75d120ccfdf7177dfecd13221b"},"schema_version":"1.0","source":{"id":"1112.1497","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1497","created_at":"2026-05-18T01:12:19Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1497v3","created_at":"2026-05-18T01:12:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1497","created_at":"2026-05-18T01:12:19Z"},{"alias_kind":"pith_short_12","alias_value":"6IMOXWTBZZT7","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6IMOXWTBZZT7R7JU","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6IMOXWTB","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:43f79b8398408e896f9f424430fddef83507fe424811b51dd69900d93fb19738","target":"graph","created_at":"2026-05-18T01:12:19Z","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 unified graphical approach to random coding for any memoryless, single-hop, K-user channel with or without common information is defined through two steps. The first step is user virtualization: each user is divided into multiple virtual sub-users according to a chosen rate-splitting strategy. This results in an enhanced channel with a possibly larger number of users for which more coding possibilities are available and for which common messages to any subset of users can be encoded. Following user virtualization, the message of each user in the enhanced model is coded using a chosen combina","authors_text":"Andrea Goldsmith, Stefano Rini","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T08:41:31Z","title":"A unified graphical approach to random coding for multi-terminal networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1497","kind":"arxiv","version":3},"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:2f12a97321e9e9a589e2144b902cb21c06860843e2ff464716659248a174587c","target":"record","created_at":"2026-05-18T01:12:19Z","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":"2d4d97b99c58665ad7ab855724873b804f2e03e72fc26f7dd6ec019d65c15b00","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T08:41:31Z","title_canon_sha256":"841a9333c6cac6f7366938a72d4582b84ffc2e75d120ccfdf7177dfecd13221b"},"schema_version":"1.0","source":{"id":"1112.1497","kind":"arxiv","version":3}},"canonical_sha256":"f218ebda61ce67f8fd34cb5b4a90b7291ad806a98abb84ee3fa0aa9b48de499a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f218ebda61ce67f8fd34cb5b4a90b7291ad806a98abb84ee3fa0aa9b48de499a","first_computed_at":"2026-05-18T01:12:19.251794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:19.251794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fg3kco9PNG8kdq7c1QYETljB3sWaGGPTvj7opZ5sLf/MIpoZ3BgF0HRl+XS2ANJLUqd2IjJpYt5sOJ3nhldtDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:19.252135Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1497","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f12a97321e9e9a589e2144b902cb21c06860843e2ff464716659248a174587c","sha256:43f79b8398408e896f9f424430fddef83507fe424811b51dd69900d93fb19738"],"state_sha256":"199e6e1bbbf3d7ee4383170dc2fb8f1c4a5f55b38b4c7bf74fe917d6aa1b082c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4EP4rs1zoVhpzzOM2GWgvwAd7TNHZ3Sj+9WrT44eKguUc0F2fiZulo2hOPsUS5ur1a25XVtKrWRf2TcEfzPwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T00:56:52.564941Z","bundle_sha256":"00903d6bd9eec66db08e55af586074f9d89404a624254084c15175c4482650c7"}}