{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:6HOCRNLDB3AKJGSSFVZDQSDZ6X","short_pith_number":"pith:6HOCRNLD","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"},"canonical_sha256":"f1dc28b5630ec0a49a522d72384879f5f2f5da197fcd85f40011f996147d5674","source":{"kind":"arxiv","id":"0810.4657","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.4657","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0810.4657v1","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.4657","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"6HOCRNLDB3AK","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"6HOCRNLDB3AKJGSS","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"6HOCRNLD","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:6HOCRNLDB3AKJGSSFVZDQSDZ6X","target":"record","payload":{"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"},"canonical_sha256":"f1dc28b5630ec0a49a522d72384879f5f2f5da197fcd85f40011f996147d5674","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"},"source_kind":"arxiv","source_id":"0810.4657","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:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2OSJTwQlMv0CDF4oStsBK3LWBV6Se/TngyYofrCtPtgCqtb/FTLDkxsWVug7TThPhHEVrt492KwRSnDiPkLFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:27:32.098446Z"},"content_sha256":"f6a7adb9d0b3a5dc39da8a462b61e378f90aed60ef8406843d50eaf2f34c4f78","schema_version":"1.0","event_id":"sha256:f6a7adb9d0b3a5dc39da8a462b61e378f90aed60ef8406843d50eaf2f34c4f78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:6HOCRNLDB3AKJGSSFVZDQSDZ6X","target":"graph","payload":{"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"},"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:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AzoW9osDqstvkqVAGFgzEn+n8YXZIEtpKkBRrwCVCjMg3J05UoTd6WtANvrv5f2BNWlPNsra3rS/72IunrGQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:27:32.098886Z"},"content_sha256":"2826db22072ea95ae57f66c7422c9f9a827aea93e7145f6ac9ff87e9fddce148","schema_version":"1.0","event_id":"sha256:2826db22072ea95ae57f66c7422c9f9a827aea93e7145f6ac9ff87e9fddce148"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6HOCRNLDB3AKJGSSFVZDQSDZ6X/bundle.json","state_url":"https://pith.science/pith/6HOCRNLDB3AKJGSSFVZDQSDZ6X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6HOCRNLDB3AKJGSSFVZDQSDZ6X/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-26T15:27:32Z","links":{"resolver":"https://pith.science/pith/6HOCRNLDB3AKJGSSFVZDQSDZ6X","bundle":"https://pith.science/pith/6HOCRNLDB3AKJGSSFVZDQSDZ6X/bundle.json","state":"https://pith.science/pith/6HOCRNLDB3AKJGSSFVZDQSDZ6X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6HOCRNLDB3AKJGSSFVZDQSDZ6X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:6HOCRNLDB3AKJGSSFVZDQSDZ6X","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":"dac539131f496d081e6dfe6d6a75ba7405e4d132eb608a989a4ca47c36972483","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-26T04:31:22Z","title_canon_sha256":"054e805dd8a9a0114c65230b0def0080967bd01a441a96997ec2674bd77dc1a8"},"schema_version":"1.0","source":{"id":"0810.4657","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.4657","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0810.4657v1","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.4657","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"6HOCRNLDB3AK","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"6HOCRNLDB3AKJGSS","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"6HOCRNLD","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:2826db22072ea95ae57f66c7422c9f9a827aea93e7145f6ac9ff87e9fddce148","target":"graph","created_at":"2026-05-18T00:58:48Z","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 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","authors_text":"Amir K. Khandani, Seyed Saeed Changiz Rezaei, Shahab Oveis Gharan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-26T04:31:22Z","title":"Cooperative Strategies for the Half-Duplex Gaussian Parallel Relay Channel: Simultaneous Relaying versus Successive Relaying"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.4657","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:f6a7adb9d0b3a5dc39da8a462b61e378f90aed60ef8406843d50eaf2f34c4f78","target":"record","created_at":"2026-05-18T00:58:48Z","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":"dac539131f496d081e6dfe6d6a75ba7405e4d132eb608a989a4ca47c36972483","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-26T04:31:22Z","title_canon_sha256":"054e805dd8a9a0114c65230b0def0080967bd01a441a96997ec2674bd77dc1a8"},"schema_version":"1.0","source":{"id":"0810.4657","kind":"arxiv","version":1}},"canonical_sha256":"f1dc28b5630ec0a49a522d72384879f5f2f5da197fcd85f40011f996147d5674","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1dc28b5630ec0a49a522d72384879f5f2f5da197fcd85f40011f996147d5674","first_computed_at":"2026-05-18T00:58:48.338908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:48.338908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QNFWlORDSzv+YvYDSpVWL3Z3UL+PiKMwxo3Zc8oLc2xRPWL7Y3gli2xAREm3mhb3CDN2Z5jlGudzF3Kw9/crBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:48.339573Z","signed_message":"canonical_sha256_bytes"},"source_id":"0810.4657","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6a7adb9d0b3a5dc39da8a462b61e378f90aed60ef8406843d50eaf2f34c4f78","sha256:2826db22072ea95ae57f66c7422c9f9a827aea93e7145f6ac9ff87e9fddce148"],"state_sha256":"f9e4d6deef8c4e83c09f194669ad99bab195f052aa4e47644a8b473ae1257f84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RqzWkSG05bIMEV+aI7jTYwN2Yaruc0RoYyPsz5IipD3afV5WQWPSghy4KQkRHMaafbFBg6T3V5Sdl5yULaQ3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:27:32.102310Z","bundle_sha256":"e7c33b2abf21e33b79672db240b883bde8fe774c0946aab34fda2bb550e594b9"}}