{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:N4MQ6WHMRKA3F6VGYADMAGUU2Y","short_pith_number":"pith:N4MQ6WHM","canonical_record":{"source":{"id":"1101.3724","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-26T17:21:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"03884bf76bd6b704050bc17be866b01b770670c48fb0a50b5d454deb6ab0f608","abstract_canon_sha256":"ca6e84e754887de49b8e3456cc5ebaec76252fb176be8c0d2b403bab9b35cc6b"},"schema_version":"1.0"},"canonical_sha256":"6f190f58ec8a81b2faa6c006c01a94d6071d040da6ce89335a7ce6acef756a10","source":{"kind":"arxiv","id":"1101.3724","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3724","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3724v2","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3724","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"pith_short_12","alias_value":"N4MQ6WHMRKA3","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"N4MQ6WHMRKA3F6VG","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"N4MQ6WHM","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:N4MQ6WHMRKA3F6VGYADMAGUU2Y","target":"record","payload":{"canonical_record":{"source":{"id":"1101.3724","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-26T17:21:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"03884bf76bd6b704050bc17be866b01b770670c48fb0a50b5d454deb6ab0f608","abstract_canon_sha256":"ca6e84e754887de49b8e3456cc5ebaec76252fb176be8c0d2b403bab9b35cc6b"},"schema_version":"1.0"},"canonical_sha256":"6f190f58ec8a81b2faa6c006c01a94d6071d040da6ce89335a7ce6acef756a10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:51.324187Z","signature_b64":"IaLKV49ddfNCW4TF/PSrJ15SFg75dnQIOzVAA2F7ccK7cheSX0Wq87QM4PjUV8GbzlPb/KILfetn904wUaw6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f190f58ec8a81b2faa6c006c01a94d6071d040da6ce89335a7ce6acef756a10","last_reissued_at":"2026-05-18T02:22:51.323819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:51.323819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.3724","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-18T02:22:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I32SOOXKDi6WcfcHMg+iXsboeORwY2tjH7okTnu/7T6Dos7uEFw46md0cumNdhX1+s3eHZKIX3pX/OON2pkMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:21.863396Z"},"content_sha256":"38cb0b8509162f977f3e9970d9dea6d017e53d35b2f54710f67519bf829f34b6","schema_version":"1.0","event_id":"sha256:38cb0b8509162f977f3e9970d9dea6d017e53d35b2f54710f67519bf829f34b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:N4MQ6WHMRKA3F6VGYADMAGUU2Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput-Delay Analysis of Random Linear Network Coding for Wireless Broadcasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Atilla Eryilmaz, B. T. Swapna, Ness B. Shroff","submitted_at":"2010-12-26T17:21:42Z","abstract_excerpt":"In an unreliable single-hop broadcast network setting, we investigate the throughput and decoding-delay performance of random linear network coding as a function of the coding window size and the network size. Our model consists of a source transmitting packets of a single flow to a set of $n$ users over independent erasure channels. The source performs random linear network coding (RLNC) over $k$ (coding window size) packets and broadcasts them to the users. We note that the broadcast throughput of RLNC must vanish with increasing $n$, for any fixed $k.$ Hence, in contrast to other works in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3724","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-18T02:22:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VkOCVBP0hRD9sZKk+T8MnyTbd1+pfpJmwO/cHltSdORenNXcM9ri2PzCnFhB1x62TP9eghlEad9QdL9eiHDsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:21.863757Z"},"content_sha256":"8e43baddc0690fefd0b360a92b8353ac24ad9c2232a5927ab13fd189c8b92506","schema_version":"1.0","event_id":"sha256:8e43baddc0690fefd0b360a92b8353ac24ad9c2232a5927ab13fd189c8b92506"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4MQ6WHMRKA3F6VGYADMAGUU2Y/bundle.json","state_url":"https://pith.science/pith/N4MQ6WHMRKA3F6VGYADMAGUU2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4MQ6WHMRKA3F6VGYADMAGUU2Y/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-30T12:05:21Z","links":{"resolver":"https://pith.science/pith/N4MQ6WHMRKA3F6VGYADMAGUU2Y","bundle":"https://pith.science/pith/N4MQ6WHMRKA3F6VGYADMAGUU2Y/bundle.json","state":"https://pith.science/pith/N4MQ6WHMRKA3F6VGYADMAGUU2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4MQ6WHMRKA3F6VGYADMAGUU2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:N4MQ6WHMRKA3F6VGYADMAGUU2Y","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":"ca6e84e754887de49b8e3456cc5ebaec76252fb176be8c0d2b403bab9b35cc6b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-26T17:21:42Z","title_canon_sha256":"03884bf76bd6b704050bc17be866b01b770670c48fb0a50b5d454deb6ab0f608"},"schema_version":"1.0","source":{"id":"1101.3724","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3724","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3724v2","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3724","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"pith_short_12","alias_value":"N4MQ6WHMRKA3","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"N4MQ6WHMRKA3F6VG","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"N4MQ6WHM","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:8e43baddc0690fefd0b360a92b8353ac24ad9c2232a5927ab13fd189c8b92506","target":"graph","created_at":"2026-05-18T02:22:51Z","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 an unreliable single-hop broadcast network setting, we investigate the throughput and decoding-delay performance of random linear network coding as a function of the coding window size and the network size. Our model consists of a source transmitting packets of a single flow to a set of $n$ users over independent erasure channels. The source performs random linear network coding (RLNC) over $k$ (coding window size) packets and broadcasts them to the users. We note that the broadcast throughput of RLNC must vanish with increasing $n$, for any fixed $k.$ Hence, in contrast to other works in t","authors_text":"Atilla Eryilmaz, B. T. Swapna, Ness B. Shroff","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-26T17:21:42Z","title":"Throughput-Delay Analysis of Random Linear Network Coding for Wireless Broadcasting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3724","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:38cb0b8509162f977f3e9970d9dea6d017e53d35b2f54710f67519bf829f34b6","target":"record","created_at":"2026-05-18T02:22:51Z","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":"ca6e84e754887de49b8e3456cc5ebaec76252fb176be8c0d2b403bab9b35cc6b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-26T17:21:42Z","title_canon_sha256":"03884bf76bd6b704050bc17be866b01b770670c48fb0a50b5d454deb6ab0f608"},"schema_version":"1.0","source":{"id":"1101.3724","kind":"arxiv","version":2}},"canonical_sha256":"6f190f58ec8a81b2faa6c006c01a94d6071d040da6ce89335a7ce6acef756a10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f190f58ec8a81b2faa6c006c01a94d6071d040da6ce89335a7ce6acef756a10","first_computed_at":"2026-05-18T02:22:51.323819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:51.323819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IaLKV49ddfNCW4TF/PSrJ15SFg75dnQIOzVAA2F7ccK7cheSX0Wq87QM4PjUV8GbzlPb/KILfetn904wUaw6Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:51.324187Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.3724","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38cb0b8509162f977f3e9970d9dea6d017e53d35b2f54710f67519bf829f34b6","sha256:8e43baddc0690fefd0b360a92b8353ac24ad9c2232a5927ab13fd189c8b92506"],"state_sha256":"5505c3b1c53d59254bf415792f9f99e7177ff418846aa57a7cda3807a9e06e41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1sMIn3CWxhTxwQ1m2DOPC/8k79PzE/Mno1zwS1XozD8eb8/PkDIiW+MmjYjL2UqmQffBNFeIJyBBAgivwbRWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:05:21.865764Z","bundle_sha256":"14cd023d9087fa8dce816fb9b6187e04d1132715d645b9ae3dbfa0f44111bf60"}}