{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:AJBGAPSKTZ53YHH2TQG45SMIKE","short_pith_number":"pith:AJBGAPSK","canonical_record":{"source":{"id":"0906.3821","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-20T17:55:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"804a79737be37252cf0725ccae93356ac25c075d21e9a5f5416ecbc3a1644a54","abstract_canon_sha256":"2e770a6c478997a5f815d235f90f2e2c3678368b1933883402c7b6bd1cb64ad2"},"schema_version":"1.0"},"canonical_sha256":"0242603e4a9e7bbc1cfa9c0dcec988512e5363766a5077187b525199327fc2de","source":{"kind":"arxiv","id":"0906.3821","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.3821","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"0906.3821v1","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.3821","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"AJBGAPSKTZ53","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"AJBGAPSKTZ53YHH2","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"AJBGAPSK","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:AJBGAPSKTZ53YHH2TQG45SMIKE","target":"record","payload":{"canonical_record":{"source":{"id":"0906.3821","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-20T17:55:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"804a79737be37252cf0725ccae93356ac25c075d21e9a5f5416ecbc3a1644a54","abstract_canon_sha256":"2e770a6c478997a5f815d235f90f2e2c3678368b1933883402c7b6bd1cb64ad2"},"schema_version":"1.0"},"canonical_sha256":"0242603e4a9e7bbc1cfa9c0dcec988512e5363766a5077187b525199327fc2de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:20.091151Z","signature_b64":"cMksDfRKRhEKOcrzY4nfxTn6tkrNeC/KYdoo4U7OaHmeX/L+D+I7/7Wl+q4tdWlRl0fv4uW5pDXr2de4wE7YBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0242603e4a9e7bbc1cfa9c0dcec988512e5363766a5077187b525199327fc2de","last_reissued_at":"2026-05-18T00:58:20.090475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:20.090475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0906.3821","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:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ziNDqpafSQIuvM8PCc+9ltBdkQm9ximunVxX2YMRohvIj2fC62F5VmDA30KM+Dm+A5dRNyzsfOhze1gBNklTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T13:36:18.161929Z"},"content_sha256":"fca92c81d4782e11b76908a8c4356d4aad416167b3ec1f85d3c56ea250360193","schema_version":"1.0","event_id":"sha256:fca92c81d4782e11b76908a8c4356d4aad416167b3ec1f85d3c56ea250360193"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:AJBGAPSKTZ53YHH2TQG45SMIKE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relaying Simultaneous Multicast Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Goldsmith, D. Gunduz, H. V. Poor, O. Simeone, S. Shamai (Shitz)","submitted_at":"2009-06-20T17:55:09Z","abstract_excerpt":"The problem of multicasting multiple messages with the help of a relay, which may also have an independent message of its own to multicast, is considered. As a first step to address this general model, referred to as the compound multiple access channel with a relay (cMACr), the capacity region of the multiple access channel with a \"cognitive\" relay is characterized, including the cases of partial and rate-limited cognition. Achievable rate regions for the cMACr model are then presented based on decode-and-forward (DF) and compress-and-forward (CF) relaying strategies. Moreover, an outer bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.3821","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:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9hPQRP33LXzUzkGyVyKqJ58i34Mqp702FuJjA90NuJGjkmhWNheFshkRCCXK+p7u3RD+lnVPWYnXOjMC55+UBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T13:36:18.162614Z"},"content_sha256":"e712a12ebe4602065e8ece2dafb4c843ab8fb27662eff478620a4933b7bab296","schema_version":"1.0","event_id":"sha256:e712a12ebe4602065e8ece2dafb4c843ab8fb27662eff478620a4933b7bab296"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJBGAPSKTZ53YHH2TQG45SMIKE/bundle.json","state_url":"https://pith.science/pith/AJBGAPSKTZ53YHH2TQG45SMIKE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJBGAPSKTZ53YHH2TQG45SMIKE/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-07T13:36:18Z","links":{"resolver":"https://pith.science/pith/AJBGAPSKTZ53YHH2TQG45SMIKE","bundle":"https://pith.science/pith/AJBGAPSKTZ53YHH2TQG45SMIKE/bundle.json","state":"https://pith.science/pith/AJBGAPSKTZ53YHH2TQG45SMIKE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJBGAPSKTZ53YHH2TQG45SMIKE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:AJBGAPSKTZ53YHH2TQG45SMIKE","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":"2e770a6c478997a5f815d235f90f2e2c3678368b1933883402c7b6bd1cb64ad2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-20T17:55:09Z","title_canon_sha256":"804a79737be37252cf0725ccae93356ac25c075d21e9a5f5416ecbc3a1644a54"},"schema_version":"1.0","source":{"id":"0906.3821","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.3821","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"0906.3821v1","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.3821","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"AJBGAPSKTZ53","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"AJBGAPSKTZ53YHH2","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"AJBGAPSK","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:e712a12ebe4602065e8ece2dafb4c843ab8fb27662eff478620a4933b7bab296","target":"graph","created_at":"2026-05-18T00:58:20Z","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":"The problem of multicasting multiple messages with the help of a relay, which may also have an independent message of its own to multicast, is considered. As a first step to address this general model, referred to as the compound multiple access channel with a relay (cMACr), the capacity region of the multiple access channel with a \"cognitive\" relay is characterized, including the cases of partial and rate-limited cognition. Achievable rate regions for the cMACr model are then presented based on decode-and-forward (DF) and compress-and-forward (CF) relaying strategies. Moreover, an outer bound","authors_text":"A. Goldsmith, D. Gunduz, H. V. Poor, O. Simeone, S. Shamai (Shitz)","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-20T17:55:09Z","title":"Relaying Simultaneous Multicast Messages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.3821","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:fca92c81d4782e11b76908a8c4356d4aad416167b3ec1f85d3c56ea250360193","target":"record","created_at":"2026-05-18T00:58:20Z","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":"2e770a6c478997a5f815d235f90f2e2c3678368b1933883402c7b6bd1cb64ad2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-20T17:55:09Z","title_canon_sha256":"804a79737be37252cf0725ccae93356ac25c075d21e9a5f5416ecbc3a1644a54"},"schema_version":"1.0","source":{"id":"0906.3821","kind":"arxiv","version":1}},"canonical_sha256":"0242603e4a9e7bbc1cfa9c0dcec988512e5363766a5077187b525199327fc2de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0242603e4a9e7bbc1cfa9c0dcec988512e5363766a5077187b525199327fc2de","first_computed_at":"2026-05-18T00:58:20.090475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:20.090475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cMksDfRKRhEKOcrzY4nfxTn6tkrNeC/KYdoo4U7OaHmeX/L+D+I7/7Wl+q4tdWlRl0fv4uW5pDXr2de4wE7YBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:20.091151Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.3821","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fca92c81d4782e11b76908a8c4356d4aad416167b3ec1f85d3c56ea250360193","sha256:e712a12ebe4602065e8ece2dafb4c843ab8fb27662eff478620a4933b7bab296"],"state_sha256":"0a4ebc3fb63931334aea9b71074203353a10187a1d06c0b162f770747f210275"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ecIvBxoaEhJQ5vzBF0xnS3K9PDY2v3ICSHuiKYBBN3cKi3da81co6/OlKHPW+TuJkLteLhM7U41iqM5+S1vDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T13:36:18.166131Z","bundle_sha256":"ad2faaa96884fd69b9dbb457bb824810fecfd4fcfbde66e548a8c4e9297a98f2"}}