{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:G3HCS4O47XW5ZB3QCXFZYCWTRI","short_pith_number":"pith:G3HCS4O4","canonical_record":{"source":{"id":"1808.03613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-10T16:35:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9d5c36e19b167c445f3d1aa8c9c57ab5aa0693f59339ed7f82f49889417e66ea","abstract_canon_sha256":"c9ee051a5db3833ffb848cbcc2088b494aa41d623e3be97e431e9718c0f3ac23"},"schema_version":"1.0"},"canonical_sha256":"36ce2971dcfdeddc877015cb9c0ad38a1403fcfd1699e349eb1057cd50258305","source":{"kind":"arxiv","id":"1808.03613","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03613","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03613v2","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03613","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"pith_short_12","alias_value":"G3HCS4O47XW5","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G3HCS4O47XW5ZB3Q","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G3HCS4O4","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:G3HCS4O47XW5ZB3QCXFZYCWTRI","target":"record","payload":{"canonical_record":{"source":{"id":"1808.03613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-10T16:35:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9d5c36e19b167c445f3d1aa8c9c57ab5aa0693f59339ed7f82f49889417e66ea","abstract_canon_sha256":"c9ee051a5db3833ffb848cbcc2088b494aa41d623e3be97e431e9718c0f3ac23"},"schema_version":"1.0"},"canonical_sha256":"36ce2971dcfdeddc877015cb9c0ad38a1403fcfd1699e349eb1057cd50258305","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:50.884169Z","signature_b64":"4QRlqUZ5WQX3YQjCsG29Z5xAcWK45zW77Y2RHKm4eRU9X9/4WXfkw6n+CKV5lfbVPDCGIDfsFk2pZXBpL0QRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36ce2971dcfdeddc877015cb9c0ad38a1403fcfd1699e349eb1057cd50258305","last_reissued_at":"2026-05-17T23:48:50.883313Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:50.883313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.03613","source_version":2,"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-17T23:48:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IhT9T/XwBDDGspibY44qnlQisqTJrI9sC/mAYVwVMLRjYfCxKVlzDmef/oc4E0Y3daxqg406HcxJjGfPve7eBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:47:40.548944Z"},"content_sha256":"46ca614396f2fce8b2c08d75d27a755ac01ecfd6eb1c0eef9cc09fc64b530718","schema_version":"1.0","event_id":"sha256:46ca614396f2fce8b2c08d75d27a755ac01ecfd6eb1c0eef9cc09fc64b530718"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:G3HCS4O47XW5ZB3QCXFZYCWTRI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reliability of Relay Networks under Random Linear Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Evgeny Tsimbalo, Magnus Sandell","submitted_at":"2018-08-10T16:35:12Z","abstract_excerpt":"We consider a single-source, multiple-relay, single-destination lossy network employing Random Linear Network coding at all transmitting nodes. We address the problem of calculating the probability of successful decoding at the destination node. In contrast with some previous studies, we assume the classical RLNC scheme, in which the relaying nodes simply re-encode packets, without resorting to decoding. In addition, we consider an arbitrary field size and take into account correlation between the relay nodes. We propose a novel upper bound for an arbitrary number of relays, which becomes exac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03613","kind":"arxiv","version":2},"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-17T23:48:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kkRDv0CU87JOBNGyk4SkPYmKQar9Veuv0Y9pQbMv6IjnwdENZqUTCWzAWG4UfGPx9IUfnnkQo7CHRBEpUg//Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:47:40.549291Z"},"content_sha256":"484e9b11b63d6ee7f2c6dbb9ab938a74cb81acf2bb60e9c0381aaa8dc0230d85","schema_version":"1.0","event_id":"sha256:484e9b11b63d6ee7f2c6dbb9ab938a74cb81acf2bb60e9c0381aaa8dc0230d85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G3HCS4O47XW5ZB3QCXFZYCWTRI/bundle.json","state_url":"https://pith.science/pith/G3HCS4O47XW5ZB3QCXFZYCWTRI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G3HCS4O47XW5ZB3QCXFZYCWTRI/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-25T08:47:40Z","links":{"resolver":"https://pith.science/pith/G3HCS4O47XW5ZB3QCXFZYCWTRI","bundle":"https://pith.science/pith/G3HCS4O47XW5ZB3QCXFZYCWTRI/bundle.json","state":"https://pith.science/pith/G3HCS4O47XW5ZB3QCXFZYCWTRI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G3HCS4O47XW5ZB3QCXFZYCWTRI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:G3HCS4O47XW5ZB3QCXFZYCWTRI","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":"c9ee051a5db3833ffb848cbcc2088b494aa41d623e3be97e431e9718c0f3ac23","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-10T16:35:12Z","title_canon_sha256":"9d5c36e19b167c445f3d1aa8c9c57ab5aa0693f59339ed7f82f49889417e66ea"},"schema_version":"1.0","source":{"id":"1808.03613","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03613","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03613v2","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03613","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"pith_short_12","alias_value":"G3HCS4O47XW5","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G3HCS4O47XW5ZB3Q","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G3HCS4O4","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:484e9b11b63d6ee7f2c6dbb9ab938a74cb81acf2bb60e9c0381aaa8dc0230d85","target":"graph","created_at":"2026-05-17T23:48:50Z","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":"We consider a single-source, multiple-relay, single-destination lossy network employing Random Linear Network coding at all transmitting nodes. We address the problem of calculating the probability of successful decoding at the destination node. In contrast with some previous studies, we assume the classical RLNC scheme, in which the relaying nodes simply re-encode packets, without resorting to decoding. In addition, we consider an arbitrary field size and take into account correlation between the relay nodes. We propose a novel upper bound for an arbitrary number of relays, which becomes exac","authors_text":"Evgeny Tsimbalo, Magnus Sandell","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-10T16:35:12Z","title":"Reliability of Relay Networks under Random Linear Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03613","kind":"arxiv","version":2},"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:46ca614396f2fce8b2c08d75d27a755ac01ecfd6eb1c0eef9cc09fc64b530718","target":"record","created_at":"2026-05-17T23:48:50Z","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":"c9ee051a5db3833ffb848cbcc2088b494aa41d623e3be97e431e9718c0f3ac23","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-10T16:35:12Z","title_canon_sha256":"9d5c36e19b167c445f3d1aa8c9c57ab5aa0693f59339ed7f82f49889417e66ea"},"schema_version":"1.0","source":{"id":"1808.03613","kind":"arxiv","version":2}},"canonical_sha256":"36ce2971dcfdeddc877015cb9c0ad38a1403fcfd1699e349eb1057cd50258305","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36ce2971dcfdeddc877015cb9c0ad38a1403fcfd1699e349eb1057cd50258305","first_computed_at":"2026-05-17T23:48:50.883313Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:50.883313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4QRlqUZ5WQX3YQjCsG29Z5xAcWK45zW77Y2RHKm4eRU9X9/4WXfkw6n+CKV5lfbVPDCGIDfsFk2pZXBpL0QRAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:50.884169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03613","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46ca614396f2fce8b2c08d75d27a755ac01ecfd6eb1c0eef9cc09fc64b530718","sha256:484e9b11b63d6ee7f2c6dbb9ab938a74cb81acf2bb60e9c0381aaa8dc0230d85"],"state_sha256":"24e575191b38307d88392415786bc1f43e3286153bd43acc075d7f2bef89629f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ckF0aalVd+S1DpaIw9atkDlbXsCvngnxWRMZhCFfmzewf9tVHtZduLGsb85z/JdOuo1JofIB9It2Aa73jijiBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:47:40.551258Z","bundle_sha256":"2133ad19964339521498764de1f0fea3d49bd1a700b71ac0e0fd53822c740add"}}