{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:6HOCRNLDB3AKJGSSFVZDQSDZ6X","short_pith_number":"pith:6HOCRNLD","schema_version":"1.0","canonical_sha256":"f1dc28b5630ec0a49a522d72384879f5f2f5da197fcd85f40011f996147d5674","source":{"kind":"arxiv","id":"0810.4657","version":1},"attestation_state":"computed","paper":{"title":"Cooperative Strategies for the Half-Duplex Gaussian Parallel Relay Channel: Simultaneous Relaying versus Successive Relaying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir K. Khandani, Seyed Saeed Changiz Rezaei, Shahab Oveis Gharan","submitted_at":"2008-10-26T04:31:22Z","abstract_excerpt":"This study investigates the problem of communication for a network composed of two half-duplex parallel relays with additive white Gaussian noise. Two protocols, i.e., \\emph{Simultaneous} and \\emph{Successive} relaying, associated with two possible relay orderings are proposed. The simultaneous relaying protocol is based on \\emph{Dynamic Decode and Forward (DDF)} scheme. For the successive relaying protocol: (i) a \\emph{Non-Cooperative} scheme based on the \\emph{Dirty Paper Coding (DPC)}, and (ii) a \\emph{Cooperative} scheme based on the \\emph{Block Markov Encoding (BME)} are considered. Furth"},"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":"0810.4657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-26T04:31:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"054e805dd8a9a0114c65230b0def0080967bd01a441a96997ec2674bd77dc1a8","abstract_canon_sha256":"dac539131f496d081e6dfe6d6a75ba7405e4d132eb608a989a4ca47c36972483"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.339573Z","signature_b64":"QNFWlORDSzv+YvYDSpVWL3Z3UL+PiKMwxo3Zc8oLc2xRPWL7Y3gli2xAREm3mhb3CDN2Z5jlGudzF3Kw9/crBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1dc28b5630ec0a49a522d72384879f5f2f5da197fcd85f40011f996147d5674","last_reissued_at":"2026-05-18T00:58:48.338908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.338908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cooperative Strategies for the Half-Duplex Gaussian Parallel Relay Channel: Simultaneous Relaying versus Successive Relaying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir K. Khandani, Seyed Saeed Changiz Rezaei, Shahab Oveis Gharan","submitted_at":"2008-10-26T04:31:22Z","abstract_excerpt":"This study investigates the problem of communication for a network composed of two half-duplex parallel relays with additive white Gaussian noise. Two protocols, i.e., \\emph{Simultaneous} and \\emph{Successive} relaying, associated with two possible relay orderings are proposed. The simultaneous relaying protocol is based on \\emph{Dynamic Decode and Forward (DDF)} scheme. For the successive relaying protocol: (i) a \\emph{Non-Cooperative} scheme based on the \\emph{Dirty Paper Coding (DPC)}, and (ii) a \\emph{Cooperative} scheme based on the \\emph{Block Markov Encoding (BME)} are considered. Furth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.4657","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":"0810.4657","created_at":"2026-05-18T00:58:48.339000+00:00"},{"alias_kind":"arxiv_version","alias_value":"0810.4657v1","created_at":"2026-05-18T00:58:48.339000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.4657","created_at":"2026-05-18T00:58:48.339000+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HOCRNLDB3AK","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HOCRNLDB3AKJGSS","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HOCRNLD","created_at":"2026-05-18T12:25:56.245647+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/6HOCRNLDB3AKJGSSFVZDQSDZ6X","json":"https://pith.science/pith/6HOCRNLDB3AKJGSSFVZDQSDZ6X.json","graph_json":"https://pith.science/api/pith-number/6HOCRNLDB3AKJGSSFVZDQSDZ6X/graph.json","events_json":"https://pith.science/api/pith-number/6HOCRNLDB3AKJGSSFVZDQSDZ6X/events.json","paper":"https://pith.science/paper/6HOCRNLD"},"agent_actions":{"view_html":"https://pith.science/pith/6HOCRNLDB3AKJGSSFVZDQSDZ6X","download_json":"https://pith.science/pith/6HOCRNLDB3AKJGSSFVZDQSDZ6X.json","view_paper":"https://pith.science/paper/6HOCRNLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0810.4657&json=true","fetch_graph":"https://pith.science/api/pith-number/6HOCRNLDB3AKJGSSFVZDQSDZ6X/graph.json","fetch_events":"https://pith.science/api/pith-number/6HOCRNLDB3AKJGSSFVZDQSDZ6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HOCRNLDB3AKJGSSFVZDQSDZ6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HOCRNLDB3AKJGSSFVZDQSDZ6X/action/storage_attestation","attest_author":"https://pith.science/pith/6HOCRNLDB3AKJGSSFVZDQSDZ6X/action/author_attestation","sign_citation":"https://pith.science/pith/6HOCRNLDB3AKJGSSFVZDQSDZ6X/action/citation_signature","submit_replication":"https://pith.science/pith/6HOCRNLDB3AKJGSSFVZDQSDZ6X/action/replication_record"}},"created_at":"2026-05-18T00:58:48.339000+00:00","updated_at":"2026-05-18T00:58:48.339000+00:00"}