{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:VBDYZL73BEWJHV6XNQH3NWAOOQ","short_pith_number":"pith:VBDYZL73","canonical_record":{"source":{"id":"1107.1839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-10T07:18:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ee9632a051a37917114e80e5ef94c1014dccf5d1c929ef2e8440701ca56ec0b1","abstract_canon_sha256":"88689c21e4f34ee35920a2996f68bd93d0dd2cd3ae0cc0096514d33bb8b3d32c"},"schema_version":"1.0"},"canonical_sha256":"a8478caffb092c93d7d76c0fb6d80e7424e02ef8c8e934e4808229cf172b30d8","source":{"kind":"arxiv","id":"1107.1839","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1839","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1839v1","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1839","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"VBDYZL73BEWJ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"VBDYZL73BEWJHV6X","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"VBDYZL73","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:VBDYZL73BEWJHV6XNQH3NWAOOQ","target":"record","payload":{"canonical_record":{"source":{"id":"1107.1839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-10T07:18:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ee9632a051a37917114e80e5ef94c1014dccf5d1c929ef2e8440701ca56ec0b1","abstract_canon_sha256":"88689c21e4f34ee35920a2996f68bd93d0dd2cd3ae0cc0096514d33bb8b3d32c"},"schema_version":"1.0"},"canonical_sha256":"a8478caffb092c93d7d76c0fb6d80e7424e02ef8c8e934e4808229cf172b30d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:38.197754Z","signature_b64":"3SxTRux+oBtHycDuQTEatMPCPCysHdGNmExiu9biotfZz175Tfze7AipLu2H1CDFHsNZ71WM1baU5YEU2RS9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8478caffb092c93d7d76c0fb6d80e7424e02ef8c8e934e4808229cf172b30d8","last_reissued_at":"2026-05-18T03:33:38.196851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:38.196851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.1839","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-18T03:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cjuW4AZn90HKQFhfKtBDYRQ7XQp9kkYI1cjN/RBB5aweGM/oxU+QzV/KBcZV0D352OHGOXpr8/xlVIDPWGJDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:32:30.821463Z"},"content_sha256":"809c8480ece52daded1ebbfc917298bd7b44a8592fea4d3c307e62dd3b7b14b1","schema_version":"1.0","event_id":"sha256:809c8480ece52daded1ebbfc917298bd7b44a8592fea4d3c307e62dd3b7b14b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:VBDYZL73BEWJHV6XNQH3NWAOOQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interference Networks with General Message Sets: A Random Coding Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farokh Marvasti, Reza K. Farsani","submitted_at":"2011-07-10T07:18:52Z","abstract_excerpt":"In this paper, the Interference Network with General Message Sets (IN-GMS) is introduced in which several transmitters send messages to several receivers: Each subset of transmitters transmit an individual message to each subset of receivers. For such a general scenario, an achievability scheme is presented using the random coding. This scheme is systematically built based on the capacity achieving scheme for the Multiple Access Channel (MAC) with common message as well as the best known achievability scheme for the Broadcast Channel (BC) with common message. A graphical illustration of the ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1839","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-18T03:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FAJZQ9ZPd1D9WSi2zWXiRkiPPAgovL88aektSEQTildPEr3EBYMOCHZQxU/6ExN9UEgNCsM4A6xKTGEzCoV5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:32:30.822032Z"},"content_sha256":"5b0eb555ef1e54689ccc113b29f08e8e77b5e42d7f285fa3b729e8a3c7a1017d","schema_version":"1.0","event_id":"sha256:5b0eb555ef1e54689ccc113b29f08e8e77b5e42d7f285fa3b729e8a3c7a1017d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBDYZL73BEWJHV6XNQH3NWAOOQ/bundle.json","state_url":"https://pith.science/pith/VBDYZL73BEWJHV6XNQH3NWAOOQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBDYZL73BEWJHV6XNQH3NWAOOQ/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-05T21:32:30Z","links":{"resolver":"https://pith.science/pith/VBDYZL73BEWJHV6XNQH3NWAOOQ","bundle":"https://pith.science/pith/VBDYZL73BEWJHV6XNQH3NWAOOQ/bundle.json","state":"https://pith.science/pith/VBDYZL73BEWJHV6XNQH3NWAOOQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBDYZL73BEWJHV6XNQH3NWAOOQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VBDYZL73BEWJHV6XNQH3NWAOOQ","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":"88689c21e4f34ee35920a2996f68bd93d0dd2cd3ae0cc0096514d33bb8b3d32c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-10T07:18:52Z","title_canon_sha256":"ee9632a051a37917114e80e5ef94c1014dccf5d1c929ef2e8440701ca56ec0b1"},"schema_version":"1.0","source":{"id":"1107.1839","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1839","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1839v1","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1839","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"VBDYZL73BEWJ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"VBDYZL73BEWJHV6X","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"VBDYZL73","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:5b0eb555ef1e54689ccc113b29f08e8e77b5e42d7f285fa3b729e8a3c7a1017d","target":"graph","created_at":"2026-05-18T03:33:38Z","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":"In this paper, the Interference Network with General Message Sets (IN-GMS) is introduced in which several transmitters send messages to several receivers: Each subset of transmitters transmit an individual message to each subset of receivers. For such a general scenario, an achievability scheme is presented using the random coding. This scheme is systematically built based on the capacity achieving scheme for the Multiple Access Channel (MAC) with common message as well as the best known achievability scheme for the Broadcast Channel (BC) with common message. A graphical illustration of the ra","authors_text":"Farokh Marvasti, Reza K. Farsani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-10T07:18:52Z","title":"Interference Networks with General Message Sets: A Random Coding Scheme"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1839","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:809c8480ece52daded1ebbfc917298bd7b44a8592fea4d3c307e62dd3b7b14b1","target":"record","created_at":"2026-05-18T03:33:38Z","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":"88689c21e4f34ee35920a2996f68bd93d0dd2cd3ae0cc0096514d33bb8b3d32c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-10T07:18:52Z","title_canon_sha256":"ee9632a051a37917114e80e5ef94c1014dccf5d1c929ef2e8440701ca56ec0b1"},"schema_version":"1.0","source":{"id":"1107.1839","kind":"arxiv","version":1}},"canonical_sha256":"a8478caffb092c93d7d76c0fb6d80e7424e02ef8c8e934e4808229cf172b30d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8478caffb092c93d7d76c0fb6d80e7424e02ef8c8e934e4808229cf172b30d8","first_computed_at":"2026-05-18T03:33:38.196851Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:38.196851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3SxTRux+oBtHycDuQTEatMPCPCysHdGNmExiu9biotfZz175Tfze7AipLu2H1CDFHsNZ71WM1baU5YEU2RS9CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:38.197754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.1839","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:809c8480ece52daded1ebbfc917298bd7b44a8592fea4d3c307e62dd3b7b14b1","sha256:5b0eb555ef1e54689ccc113b29f08e8e77b5e42d7f285fa3b729e8a3c7a1017d"],"state_sha256":"716795d134541ab4505027d89d2705579f8bfd2d446c1741e89c6b80ca3fb54d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qwt9dn7hsOwf/WIgvTKULN3BEjXKctqTpA9fQfvXkvlXmXk9LNfYLR3qOvspnR8WGcYSrOyRrBONuFSAw0tCCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:32:30.824968Z","bundle_sha256":"72752354c8ca0b9b0160277ffb4b8497d30f9a81913d3bb805714fe5c03896cb"}}