{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZSQRI25VHFUAC4GKU7QN7OHRZB","short_pith_number":"pith:ZSQRI25V","canonical_record":{"source":{"id":"1201.1941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-09T22:53:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5111647b562c548007b46eff013a4ce9ca10cce80e11da49d8310613f8a2d937","abstract_canon_sha256":"abaeef447a5ea3b794a40ee82c471ef8a7bcc6232c39561355c2cc6b6204e63b"},"schema_version":"1.0"},"canonical_sha256":"cca1146bb539680170caa7e0dfb8f1c8722ba557097288d1dce4d2614a8463d1","source":{"kind":"arxiv","id":"1201.1941","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1941","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1941v1","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1941","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZSQRI25VHFUA","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZSQRI25VHFUAC4GK","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZSQRI25V","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZSQRI25VHFUAC4GKU7QN7OHRZB","target":"record","payload":{"canonical_record":{"source":{"id":"1201.1941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-09T22:53:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5111647b562c548007b46eff013a4ce9ca10cce80e11da49d8310613f8a2d937","abstract_canon_sha256":"abaeef447a5ea3b794a40ee82c471ef8a7bcc6232c39561355c2cc6b6204e63b"},"schema_version":"1.0"},"canonical_sha256":"cca1146bb539680170caa7e0dfb8f1c8722ba557097288d1dce4d2614a8463d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:18.614511Z","signature_b64":"pNJIebrtwjLClgXtCjXvMZJ7khAp/FBhI2m1fvEqVj8Nx+f5uZOgiHxt3yE3JFnN15CaerfY4N9tCvNcn9OpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cca1146bb539680170caa7e0dfb8f1c8722ba557097288d1dce4d2614a8463d1","last_reissued_at":"2026-05-18T02:21:18.613863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:18.613863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.1941","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-18T02:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YgS8gaL6OU7E9pF3hfb5CMpU5mOEoJemKf0gDxDdKNKirEUjGSW2DvKQX7uA/Pyc/1bl5rzkTf2Jm5mdfBOzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:30:12.053163Z"},"content_sha256":"88544782fd9649a1679c9109c24adabddf4074d1b116ddb6a873f7b7db387c68","schema_version":"1.0","event_id":"sha256:88544782fd9649a1679c9109c24adabddf4074d1b116ddb6a873f7b7db387c68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZSQRI25VHFUAC4GKU7QN7OHRZB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relaying for Multiuser Networks in the Absence of Codebook Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aylin Yener, Ye Tian","submitted_at":"2012-01-09T22:53:19Z","abstract_excerpt":"This work considers relay assisted transmission for multiuser networks when the relay has no access to the codebooks used by the transmitters. The relay is called oblivious for this reason. Of particular interest is the generalized compress-and-forward (GCF) strategy, where the destinations jointly decode the compression indices and the transmitted messages, and their optimality in this setting. The relay-to-destination links are assumed to be out-of-band with finite capacity. Two models are investigated: the multiple access relay channel (MARC) and the interference relay channel (IFRC). For t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1941","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-18T02:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iAg7Em8xZQEbBNDYMDE4h5el2fuWSJ/mSmnZ9U91X3/cJa1TxO4hf+2rCo/fgHCR+vrYGPzzUzfGYCb1lSiACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:30:12.054132Z"},"content_sha256":"a04a387d6392ef977cc82668286d15705e466952ddc7c02ce4fb2f363790b819","schema_version":"1.0","event_id":"sha256:a04a387d6392ef977cc82668286d15705e466952ddc7c02ce4fb2f363790b819"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSQRI25VHFUAC4GKU7QN7OHRZB/bundle.json","state_url":"https://pith.science/pith/ZSQRI25VHFUAC4GKU7QN7OHRZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSQRI25VHFUAC4GKU7QN7OHRZB/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-05-30T18:30:12Z","links":{"resolver":"https://pith.science/pith/ZSQRI25VHFUAC4GKU7QN7OHRZB","bundle":"https://pith.science/pith/ZSQRI25VHFUAC4GKU7QN7OHRZB/bundle.json","state":"https://pith.science/pith/ZSQRI25VHFUAC4GKU7QN7OHRZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSQRI25VHFUAC4GKU7QN7OHRZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZSQRI25VHFUAC4GKU7QN7OHRZB","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":"abaeef447a5ea3b794a40ee82c471ef8a7bcc6232c39561355c2cc6b6204e63b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-09T22:53:19Z","title_canon_sha256":"5111647b562c548007b46eff013a4ce9ca10cce80e11da49d8310613f8a2d937"},"schema_version":"1.0","source":{"id":"1201.1941","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1941","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1941v1","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1941","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZSQRI25VHFUA","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZSQRI25VHFUAC4GK","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZSQRI25V","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:a04a387d6392ef977cc82668286d15705e466952ddc7c02ce4fb2f363790b819","target":"graph","created_at":"2026-05-18T02:21:18Z","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":"This work considers relay assisted transmission for multiuser networks when the relay has no access to the codebooks used by the transmitters. The relay is called oblivious for this reason. Of particular interest is the generalized compress-and-forward (GCF) strategy, where the destinations jointly decode the compression indices and the transmitted messages, and their optimality in this setting. The relay-to-destination links are assumed to be out-of-band with finite capacity. Two models are investigated: the multiple access relay channel (MARC) and the interference relay channel (IFRC). For t","authors_text":"Aylin Yener, Ye Tian","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-09T22:53:19Z","title":"Relaying for Multiuser Networks in the Absence of Codebook Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1941","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:88544782fd9649a1679c9109c24adabddf4074d1b116ddb6a873f7b7db387c68","target":"record","created_at":"2026-05-18T02:21:18Z","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":"abaeef447a5ea3b794a40ee82c471ef8a7bcc6232c39561355c2cc6b6204e63b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-09T22:53:19Z","title_canon_sha256":"5111647b562c548007b46eff013a4ce9ca10cce80e11da49d8310613f8a2d937"},"schema_version":"1.0","source":{"id":"1201.1941","kind":"arxiv","version":1}},"canonical_sha256":"cca1146bb539680170caa7e0dfb8f1c8722ba557097288d1dce4d2614a8463d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cca1146bb539680170caa7e0dfb8f1c8722ba557097288d1dce4d2614a8463d1","first_computed_at":"2026-05-18T02:21:18.613863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:18.613863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pNJIebrtwjLClgXtCjXvMZJ7khAp/FBhI2m1fvEqVj8Nx+f5uZOgiHxt3yE3JFnN15CaerfY4N9tCvNcn9OpAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:18.614511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.1941","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88544782fd9649a1679c9109c24adabddf4074d1b116ddb6a873f7b7db387c68","sha256:a04a387d6392ef977cc82668286d15705e466952ddc7c02ce4fb2f363790b819"],"state_sha256":"313bf3e097e3b8f5ed99799f7b7ced7391a14f90c5763f12b5769d2cb6fa05b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kXpOugG0lubZXzG0931xaq7Bp8Wh81DiBv1GHRyWdBtevL20xu7mRNzhJbLVH3uHYwzvFUGcHOfXAzSSFj4LCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:30:12.057686Z","bundle_sha256":"ea89041f6b5c953d5cbf661cf6daff8e6d4f5c9da22932827b3d743287c1da09"}}