{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZSQRI25VHFUAC4GKU7QN7OHRZB","short_pith_number":"pith:ZSQRI25V","schema_version":"1.0","canonical_sha256":"cca1146bb539680170caa7e0dfb8f1c8722ba557097288d1dce4d2614a8463d1","source":{"kind":"arxiv","id":"1201.1941","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.1941","created_at":"2026-05-18T02:21:18.613942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.1941v1","created_at":"2026-05-18T02:21:18.613942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1941","created_at":"2026-05-18T02:21:18.613942+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZSQRI25VHFUA","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZSQRI25VHFUAC4GK","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZSQRI25V","created_at":"2026-05-18T12:27:30.460161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZSQRI25VHFUAC4GKU7QN7OHRZB","json":"https://pith.science/pith/ZSQRI25VHFUAC4GKU7QN7OHRZB.json","graph_json":"https://pith.science/api/pith-number/ZSQRI25VHFUAC4GKU7QN7OHRZB/graph.json","events_json":"https://pith.science/api/pith-number/ZSQRI25VHFUAC4GKU7QN7OHRZB/events.json","paper":"https://pith.science/paper/ZSQRI25V"},"agent_actions":{"view_html":"https://pith.science/pith/ZSQRI25VHFUAC4GKU7QN7OHRZB","download_json":"https://pith.science/pith/ZSQRI25VHFUAC4GKU7QN7OHRZB.json","view_paper":"https://pith.science/paper/ZSQRI25V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.1941&json=true","fetch_graph":"https://pith.science/api/pith-number/ZSQRI25VHFUAC4GKU7QN7OHRZB/graph.json","fetch_events":"https://pith.science/api/pith-number/ZSQRI25VHFUAC4GKU7QN7OHRZB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZSQRI25VHFUAC4GKU7QN7OHRZB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZSQRI25VHFUAC4GKU7QN7OHRZB/action/storage_attestation","attest_author":"https://pith.science/pith/ZSQRI25VHFUAC4GKU7QN7OHRZB/action/author_attestation","sign_citation":"https://pith.science/pith/ZSQRI25VHFUAC4GKU7QN7OHRZB/action/citation_signature","submit_replication":"https://pith.science/pith/ZSQRI25VHFUAC4GKU7QN7OHRZB/action/replication_record"}},"created_at":"2026-05-18T02:21:18.613942+00:00","updated_at":"2026-05-18T02:21:18.613942+00:00"}