{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:S3AQVLBSIHNISU47O37BLMNJDX","short_pith_number":"pith:S3AQVLBS","canonical_record":{"source":{"id":"1312.1593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-05T16:05:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ecf741b808f6beeabe63e7aff3fe226f25eb83aa534f16ec9182532c66f9c8dd","abstract_canon_sha256":"6fb7bbb9c75734791080c65f206ab0eb71fed6407c988a2ad374c56f536ef0f2"},"schema_version":"1.0"},"canonical_sha256":"96c10aac3241da89539f76fe15b1a91dd1dc6cd6684fadb3e5a431bc3439156f","source":{"kind":"arxiv","id":"1312.1593","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1593","created_at":"2026-05-18T03:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1593v1","created_at":"2026-05-18T03:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1593","created_at":"2026-05-18T03:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"S3AQVLBSIHNI","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"S3AQVLBSIHNISU47","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"S3AQVLBS","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:S3AQVLBSIHNISU47O37BLMNJDX","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-05T16:05:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ecf741b808f6beeabe63e7aff3fe226f25eb83aa534f16ec9182532c66f9c8dd","abstract_canon_sha256":"6fb7bbb9c75734791080c65f206ab0eb71fed6407c988a2ad374c56f536ef0f2"},"schema_version":"1.0"},"canonical_sha256":"96c10aac3241da89539f76fe15b1a91dd1dc6cd6684fadb3e5a431bc3439156f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:26.798371Z","signature_b64":"9dTSJhVnSOlSJaTKUO/T632VnVnJJi+ptJgZFBRsMosN5PMloYnDmAikLiU1KHTm8cqZTC5qVsKFJC9Yz7zeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96c10aac3241da89539f76fe15b1a91dd1dc6cd6684fadb3e5a431bc3439156f","last_reissued_at":"2026-05-18T03:05:26.797678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:26.797678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1593","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-18T03:05:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H6ku7j4Rlla7kcG7OufaANUHoHk2AMVRLWa7Xu2IFL0cYOA2R8GKZecqgh8B5so9wfY2pgiCU1WMQPApqIHlCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:00:06.754811Z"},"content_sha256":"352dd3171ef3e64de40fe69fff680709ac52e96b037836035005b2bad8e3246e","schema_version":"1.0","event_id":"sha256:352dd3171ef3e64de40fe69fff680709ac52e96b037836035005b2bad8e3246e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:S3AQVLBSIHNISU47O37BLMNJDX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance Analysis of Network Coded Systems Under Quasi-static Rayleigh Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Ozgur Yilmaz, Emre Aktas, Tugcan Aktas","submitted_at":"2013-12-05T16:05:43Z","abstract_excerpt":"In the area of basic and network coded cooperative communication, the expected end-to-end bit error rate (BER) values are frequently required to compare the proposed coding, relaying, and decoding techniques. Instead of obtaining these values via time consuming Monte Carlo simulations, deriving closed form expressions using approximations is crucial. In this work, the ultimate goal is to derive an approximate average BER expression for a network coded system. While reaching this goal, we firstly consider the cooperative systems' instantaneous BER values that are commonly composed of Q-function"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1593","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-18T03:05:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7btFZRdERTyDmvfW+lxX1xE7FpXsPFH4Xq3g3gMs0EbHZ6t5oeJdhypO1qhyZ2UnGrWcrR+vAh7wfcjks+FQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:00:06.755160Z"},"content_sha256":"1698f18c775ac4d173c6516dc1d2e38c99292955673df4d5ee3bea120f4a40f1","schema_version":"1.0","event_id":"sha256:1698f18c775ac4d173c6516dc1d2e38c99292955673df4d5ee3bea120f4a40f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S3AQVLBSIHNISU47O37BLMNJDX/bundle.json","state_url":"https://pith.science/pith/S3AQVLBSIHNISU47O37BLMNJDX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S3AQVLBSIHNISU47O37BLMNJDX/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-06-03T10:00:06Z","links":{"resolver":"https://pith.science/pith/S3AQVLBSIHNISU47O37BLMNJDX","bundle":"https://pith.science/pith/S3AQVLBSIHNISU47O37BLMNJDX/bundle.json","state":"https://pith.science/pith/S3AQVLBSIHNISU47O37BLMNJDX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S3AQVLBSIHNISU47O37BLMNJDX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:S3AQVLBSIHNISU47O37BLMNJDX","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":"6fb7bbb9c75734791080c65f206ab0eb71fed6407c988a2ad374c56f536ef0f2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-05T16:05:43Z","title_canon_sha256":"ecf741b808f6beeabe63e7aff3fe226f25eb83aa534f16ec9182532c66f9c8dd"},"schema_version":"1.0","source":{"id":"1312.1593","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1593","created_at":"2026-05-18T03:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1593v1","created_at":"2026-05-18T03:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1593","created_at":"2026-05-18T03:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"S3AQVLBSIHNI","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"S3AQVLBSIHNISU47","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"S3AQVLBS","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:1698f18c775ac4d173c6516dc1d2e38c99292955673df4d5ee3bea120f4a40f1","target":"graph","created_at":"2026-05-18T03:05:26Z","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":"In the area of basic and network coded cooperative communication, the expected end-to-end bit error rate (BER) values are frequently required to compare the proposed coding, relaying, and decoding techniques. Instead of obtaining these values via time consuming Monte Carlo simulations, deriving closed form expressions using approximations is crucial. In this work, the ultimate goal is to derive an approximate average BER expression for a network coded system. While reaching this goal, we firstly consider the cooperative systems' instantaneous BER values that are commonly composed of Q-function","authors_text":"A. Ozgur Yilmaz, Emre Aktas, Tugcan Aktas","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-05T16:05:43Z","title":"Performance Analysis of Network Coded Systems Under Quasi-static Rayleigh Fading Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1593","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:352dd3171ef3e64de40fe69fff680709ac52e96b037836035005b2bad8e3246e","target":"record","created_at":"2026-05-18T03:05:26Z","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":"6fb7bbb9c75734791080c65f206ab0eb71fed6407c988a2ad374c56f536ef0f2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-05T16:05:43Z","title_canon_sha256":"ecf741b808f6beeabe63e7aff3fe226f25eb83aa534f16ec9182532c66f9c8dd"},"schema_version":"1.0","source":{"id":"1312.1593","kind":"arxiv","version":1}},"canonical_sha256":"96c10aac3241da89539f76fe15b1a91dd1dc6cd6684fadb3e5a431bc3439156f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96c10aac3241da89539f76fe15b1a91dd1dc6cd6684fadb3e5a431bc3439156f","first_computed_at":"2026-05-18T03:05:26.797678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:26.797678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9dTSJhVnSOlSJaTKUO/T632VnVnJJi+ptJgZFBRsMosN5PMloYnDmAikLiU1KHTm8cqZTC5qVsKFJC9Yz7zeDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:26.798371Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1593","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:352dd3171ef3e64de40fe69fff680709ac52e96b037836035005b2bad8e3246e","sha256:1698f18c775ac4d173c6516dc1d2e38c99292955673df4d5ee3bea120f4a40f1"],"state_sha256":"84e1ec760cb30c47cd26b5fe070072cdda8be1a0b165d1eccd03f16c9506f434"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zWcdNnDQvcwrmy4ei6pwkTGaHJ3gmkktzCWqxQk3x6Y6n7Qlp6SFNUpTMX/87jPheGjmJP9qWDqzrOwchMWpCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T10:00:06.757917Z","bundle_sha256":"f2f214be7b89c3427bb93c240be6d18ade0ef7a774821886a0820d3a0e55cef8"}}