{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WVAG3326QAAQ62SDUYKSM3NVV6","short_pith_number":"pith:WVAG3326","canonical_record":{"source":{"id":"1505.05939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-22T03:13:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"95f561ef13d073f1bfd0a92d79eb043bcfb7d299d6de31a4cd971061a967b772","abstract_canon_sha256":"75145752f8f6dee8e9655a219b9597693e21dda576acc7de8d6a24cec2ab0b2b"},"schema_version":"1.0"},"canonical_sha256":"b5406def5e80010f6a43a615266db5afa8bee088468a7ec0d032c3dfc90b7cd9","source":{"kind":"arxiv","id":"1505.05939","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05939","created_at":"2026-05-18T02:03:49Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05939v1","created_at":"2026-05-18T02:03:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05939","created_at":"2026-05-18T02:03:49Z"},{"alias_kind":"pith_short_12","alias_value":"WVAG3326QAAQ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WVAG3326QAAQ62SD","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WVAG3326","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WVAG3326QAAQ62SDUYKSM3NVV6","target":"record","payload":{"canonical_record":{"source":{"id":"1505.05939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-22T03:13:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"95f561ef13d073f1bfd0a92d79eb043bcfb7d299d6de31a4cd971061a967b772","abstract_canon_sha256":"75145752f8f6dee8e9655a219b9597693e21dda576acc7de8d6a24cec2ab0b2b"},"schema_version":"1.0"},"canonical_sha256":"b5406def5e80010f6a43a615266db5afa8bee088468a7ec0d032c3dfc90b7cd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:49.606962Z","signature_b64":"mNdt2RGFO/QJOla6LFN0qIRoqYWJ3SL2ygJvSV8w61u0CxCZQ5E62JaiovOH1yXZXVOm+x2jLn1Tu9WTnC6EBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5406def5e80010f6a43a615266db5afa8bee088468a7ec0d032c3dfc90b7cd9","last_reissued_at":"2026-05-18T02:03:49.606464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:49.606464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.05939","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:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qEG+grX3cVFMEe2/0FAPEOEpQL5n0kIZX41lcZiXuDU1MT36RomLuwoaUHLYWVYMQh0Wsn7i2GMAB0GLmToRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T22:22:51.317678Z"},"content_sha256":"17a0a7fa8bdd7312302a654a75e2079bb9583c59a2aafc2e005894c1287d3bff","schema_version":"1.0","event_id":"sha256:17a0a7fa8bdd7312302a654a75e2079bb9583c59a2aafc2e005894c1287d3bff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WVAG3326QAAQ62SDUYKSM3NVV6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite-SNR Analysis of Partial Relaying with Relay Selection in Channel-coded Cooperative Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Pierre Duhamel, Thang X. Vu","submitted_at":"2015-05-22T03:13:47Z","abstract_excerpt":"This work studies the performance of a cooperative network which consists of two channel-coded sources, multiple relays, and one destination. Due to spectral efficiency constraint, we assume only one time slot is dedicated for relaying. Conventional network coding based cooperation (NCC) selects the best relay which uses network coding to serve two sources simultaneously. The performance in terms of bit error rate (BER) of NCC, however, is not available in the literature. In this paper, we first derive the closed-form expression for the BER of NCC and analytically show that NCC always achieves"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05939","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:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l173ERRRT9/xC/5GWhfdzYKyDY7NfsJQMNI12zFPO6f7TenYtFvaeOEn1iYXoY3jHvH2mHzraeFN8jLLLRB/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T22:22:51.318130Z"},"content_sha256":"bc841c5bef936b38f7cdeb9890dd1bc304b2d7981cf166335f3840d89ff065ef","schema_version":"1.0","event_id":"sha256:bc841c5bef936b38f7cdeb9890dd1bc304b2d7981cf166335f3840d89ff065ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WVAG3326QAAQ62SDUYKSM3NVV6/bundle.json","state_url":"https://pith.science/pith/WVAG3326QAAQ62SDUYKSM3NVV6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WVAG3326QAAQ62SDUYKSM3NVV6/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-08-22T22:22:51Z","links":{"resolver":"https://pith.science/pith/WVAG3326QAAQ62SDUYKSM3NVV6","bundle":"https://pith.science/pith/WVAG3326QAAQ62SDUYKSM3NVV6/bundle.json","state":"https://pith.science/pith/WVAG3326QAAQ62SDUYKSM3NVV6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WVAG3326QAAQ62SDUYKSM3NVV6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WVAG3326QAAQ62SDUYKSM3NVV6","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":"75145752f8f6dee8e9655a219b9597693e21dda576acc7de8d6a24cec2ab0b2b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-22T03:13:47Z","title_canon_sha256":"95f561ef13d073f1bfd0a92d79eb043bcfb7d299d6de31a4cd971061a967b772"},"schema_version":"1.0","source":{"id":"1505.05939","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05939","created_at":"2026-05-18T02:03:49Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05939v1","created_at":"2026-05-18T02:03:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05939","created_at":"2026-05-18T02:03:49Z"},{"alias_kind":"pith_short_12","alias_value":"WVAG3326QAAQ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WVAG3326QAAQ62SD","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WVAG3326","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:bc841c5bef936b38f7cdeb9890dd1bc304b2d7981cf166335f3840d89ff065ef","target":"graph","created_at":"2026-05-18T02:03:49Z","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 studies the performance of a cooperative network which consists of two channel-coded sources, multiple relays, and one destination. Due to spectral efficiency constraint, we assume only one time slot is dedicated for relaying. Conventional network coding based cooperation (NCC) selects the best relay which uses network coding to serve two sources simultaneously. The performance in terms of bit error rate (BER) of NCC, however, is not available in the literature. In this paper, we first derive the closed-form expression for the BER of NCC and analytically show that NCC always achieves","authors_text":"Pierre Duhamel, Thang X. Vu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-22T03:13:47Z","title":"Finite-SNR Analysis of Partial Relaying with Relay Selection in Channel-coded Cooperative Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05939","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:17a0a7fa8bdd7312302a654a75e2079bb9583c59a2aafc2e005894c1287d3bff","target":"record","created_at":"2026-05-18T02:03:49Z","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":"75145752f8f6dee8e9655a219b9597693e21dda576acc7de8d6a24cec2ab0b2b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-22T03:13:47Z","title_canon_sha256":"95f561ef13d073f1bfd0a92d79eb043bcfb7d299d6de31a4cd971061a967b772"},"schema_version":"1.0","source":{"id":"1505.05939","kind":"arxiv","version":1}},"canonical_sha256":"b5406def5e80010f6a43a615266db5afa8bee088468a7ec0d032c3dfc90b7cd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5406def5e80010f6a43a615266db5afa8bee088468a7ec0d032c3dfc90b7cd9","first_computed_at":"2026-05-18T02:03:49.606464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:49.606464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mNdt2RGFO/QJOla6LFN0qIRoqYWJ3SL2ygJvSV8w61u0CxCZQ5E62JaiovOH1yXZXVOm+x2jLn1Tu9WTnC6EBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:49.606962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.05939","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17a0a7fa8bdd7312302a654a75e2079bb9583c59a2aafc2e005894c1287d3bff","sha256:bc841c5bef936b38f7cdeb9890dd1bc304b2d7981cf166335f3840d89ff065ef"],"state_sha256":"1e9e89244184e181ddc217dcb7743ed63c64410404b826bc05d2763d22c85ce1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Hl3pWv7IwlX8cKDYHIdWzjh9RdBlOoXVCiXCdqsWvEzGUSR71hy7J6DVUq22DOQ1I1a0XK4kKoKATPXjTg/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T22:22:51.321827Z","bundle_sha256":"9d0c45621fabebfff8f5ed9ce85c27ee11c12dbb5b80053285ea9b08c16bae85"}}