{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NGOBM4PRD753EEJZUQZOK5DWPG","short_pith_number":"pith:NGOBM4PR","schema_version":"1.0","canonical_sha256":"699c1671f11ffbb21139a432e574767986b15a57f58cf56fd88945286db6e4b1","source":{"kind":"arxiv","id":"1209.4889","version":1},"attestation_state":"computed","paper":{"title":"A Unified Relay Framework with both D-F and C-F Relay Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Liang-Liang Xie, Xiugang Wu","submitted_at":"2012-09-21T19:29:18Z","abstract_excerpt":"Decode-and-forward (D-F) and compress-and-forward (C-F) are two fundamentally different relay strategies proposed by (Cover and El Gamal, 1979). Individually, either of them has been successfully generalized to multi-relay channels. In this paper, to allow each relay node the freedom of choosing either of the two strategies, we propose a unified framework, where both the D-F and C-F strategies can be employed simultaneously in the network. It turns out that, to fully incorporate the advantages of both the best known D-F and C-F strategies into a unified framework, the major challenge arises as"},"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":"1209.4889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-21T19:29:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"993e8d89d5dea77097e740c3139c85e95596e87b412a4768f007a2df5a9045e0","abstract_canon_sha256":"246175bb79b79e88ec166bcf95bf71293f8f04bdf5e03049cab3895c9244de41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:01.525495Z","signature_b64":"P9loW1PzPAwzDyiQHkjgwMB9ICqk95XuW317jeK5e8Xv1FA2NYlJtr9MBgUcYkc3nWTr0o7WO6WFmALtcfelCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"699c1671f11ffbb21139a432e574767986b15a57f58cf56fd88945286db6e4b1","last_reissued_at":"2026-05-18T03:45:01.524767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:01.524767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Relay Framework with both D-F and C-F Relay Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Liang-Liang Xie, Xiugang Wu","submitted_at":"2012-09-21T19:29:18Z","abstract_excerpt":"Decode-and-forward (D-F) and compress-and-forward (C-F) are two fundamentally different relay strategies proposed by (Cover and El Gamal, 1979). Individually, either of them has been successfully generalized to multi-relay channels. In this paper, to allow each relay node the freedom of choosing either of the two strategies, we propose a unified framework, where both the D-F and C-F strategies can be employed simultaneously in the network. It turns out that, to fully incorporate the advantages of both the best known D-F and C-F strategies into a unified framework, the major challenge arises as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4889","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":"1209.4889","created_at":"2026-05-18T03:45:01.524880+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.4889v1","created_at":"2026-05-18T03:45:01.524880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4889","created_at":"2026-05-18T03:45:01.524880+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGOBM4PRD753","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGOBM4PRD753EEJZ","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGOBM4PR","created_at":"2026-05-18T12:27:16.716162+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/NGOBM4PRD753EEJZUQZOK5DWPG","json":"https://pith.science/pith/NGOBM4PRD753EEJZUQZOK5DWPG.json","graph_json":"https://pith.science/api/pith-number/NGOBM4PRD753EEJZUQZOK5DWPG/graph.json","events_json":"https://pith.science/api/pith-number/NGOBM4PRD753EEJZUQZOK5DWPG/events.json","paper":"https://pith.science/paper/NGOBM4PR"},"agent_actions":{"view_html":"https://pith.science/pith/NGOBM4PRD753EEJZUQZOK5DWPG","download_json":"https://pith.science/pith/NGOBM4PRD753EEJZUQZOK5DWPG.json","view_paper":"https://pith.science/paper/NGOBM4PR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.4889&json=true","fetch_graph":"https://pith.science/api/pith-number/NGOBM4PRD753EEJZUQZOK5DWPG/graph.json","fetch_events":"https://pith.science/api/pith-number/NGOBM4PRD753EEJZUQZOK5DWPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGOBM4PRD753EEJZUQZOK5DWPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGOBM4PRD753EEJZUQZOK5DWPG/action/storage_attestation","attest_author":"https://pith.science/pith/NGOBM4PRD753EEJZUQZOK5DWPG/action/author_attestation","sign_citation":"https://pith.science/pith/NGOBM4PRD753EEJZUQZOK5DWPG/action/citation_signature","submit_replication":"https://pith.science/pith/NGOBM4PRD753EEJZUQZOK5DWPG/action/replication_record"}},"created_at":"2026-05-18T03:45:01.524880+00:00","updated_at":"2026-05-18T03:45:01.524880+00:00"}