{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2LLWUTSMKEKYU7TEVEZ4BDJSBO","short_pith_number":"pith:2LLWUTSM","canonical_record":{"source":{"id":"1112.2810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-13T07:46:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"70052b6f792714ebb738b2441f31f214b543441c9edaf6ed424a064e9961d10f","abstract_canon_sha256":"2e9ba89faa293ac0f83d41c6ff8651d622e1353b9fcfcf8deb20df9fc607f32b"},"schema_version":"1.0"},"canonical_sha256":"d2d76a4e4c51158a7e64a933c08d320bb8f9fd8db7c2860d033d0e417d511c07","source":{"kind":"arxiv","id":"1112.2810","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2810","created_at":"2026-05-18T04:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2810v1","created_at":"2026-05-18T04:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2810","created_at":"2026-05-18T04:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"2LLWUTSMKEKY","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2LLWUTSMKEKYU7TE","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2LLWUTSM","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2LLWUTSMKEKYU7TEVEZ4BDJSBO","target":"record","payload":{"canonical_record":{"source":{"id":"1112.2810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-13T07:46:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"70052b6f792714ebb738b2441f31f214b543441c9edaf6ed424a064e9961d10f","abstract_canon_sha256":"2e9ba89faa293ac0f83d41c6ff8651d622e1353b9fcfcf8deb20df9fc607f32b"},"schema_version":"1.0"},"canonical_sha256":"d2d76a4e4c51158a7e64a933c08d320bb8f9fd8db7c2860d033d0e417d511c07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:32.370934Z","signature_b64":"rwAQ6bvqWGhtncDy4PFU5huo186zqtLJWjQHmYWmTXwgf1ZJm6loI/ON1eKkcvN8SzvbH1EyTFMOIzsCDUlDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2d76a4e4c51158a7e64a933c08d320bb8f9fd8db7c2860d033d0e417d511c07","last_reissued_at":"2026-05-18T04:06:32.370157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:32.370157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.2810","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-18T04:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wJG76NXqxyLyEjVLdwWcLgaR3TG31MNrXhKdjKRzwuCJqfCMnJCzGn5GDf7h1cG6GzStQd7dxU2U8Wmh0hn4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:18:43.413414Z"},"content_sha256":"5cf91b3b3a2ac6ba0598e2fb32f5815047cb8850545211703f960e0d3541a616","schema_version":"1.0","event_id":"sha256:5cf91b3b3a2ac6ba0598e2fb32f5815047cb8850545211703f960e0d3541a616"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2LLWUTSMKEKYU7TEVEZ4BDJSBO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Modeling of the Performance of Random Linear Network Coding in Finite-buffer Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmad Beirami, Badri N. Vellambi, Faramarz Fekri, Nima Torabkhani","submitted_at":"2011-12-13T07:46:45Z","abstract_excerpt":"In this paper, we present an exact model for the analysis of the performance of Random Linear Network Coding (RLNC) in wired erasure networks with finite buffers. In such networks, packets are delayed due to either random link erasures or blocking by full buffers. We assert that because of RLNC, the content of buffers have dependencies which cannot be captured directly using the classical queueing theoretical models. We model the performance of the network using Markov chains by a careful derivation of the buffer occupancy states and their transition rules. We verify by simulations that the pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2810","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-18T04:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MkSarLrrJvNDO9hpSVHRs9pjfMJf9Dqyh88JXPw1Ye/pAZxVpp/N2usLh2WBtXTgrB9HKdwQrNYqv0V9aZ20Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:18:43.413773Z"},"content_sha256":"36633b9758dbddd07cb1ffbd55b59743d67cf62dc857193b7cf7a7bfb7e660d6","schema_version":"1.0","event_id":"sha256:36633b9758dbddd07cb1ffbd55b59743d67cf62dc857193b7cf7a7bfb7e660d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2LLWUTSMKEKYU7TEVEZ4BDJSBO/bundle.json","state_url":"https://pith.science/pith/2LLWUTSMKEKYU7TEVEZ4BDJSBO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2LLWUTSMKEKYU7TEVEZ4BDJSBO/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-28T12:18:43Z","links":{"resolver":"https://pith.science/pith/2LLWUTSMKEKYU7TEVEZ4BDJSBO","bundle":"https://pith.science/pith/2LLWUTSMKEKYU7TEVEZ4BDJSBO/bundle.json","state":"https://pith.science/pith/2LLWUTSMKEKYU7TEVEZ4BDJSBO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2LLWUTSMKEKYU7TEVEZ4BDJSBO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2LLWUTSMKEKYU7TEVEZ4BDJSBO","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":"2e9ba89faa293ac0f83d41c6ff8651d622e1353b9fcfcf8deb20df9fc607f32b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-13T07:46:45Z","title_canon_sha256":"70052b6f792714ebb738b2441f31f214b543441c9edaf6ed424a064e9961d10f"},"schema_version":"1.0","source":{"id":"1112.2810","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2810","created_at":"2026-05-18T04:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2810v1","created_at":"2026-05-18T04:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2810","created_at":"2026-05-18T04:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"2LLWUTSMKEKY","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2LLWUTSMKEKYU7TE","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2LLWUTSM","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:36633b9758dbddd07cb1ffbd55b59743d67cf62dc857193b7cf7a7bfb7e660d6","target":"graph","created_at":"2026-05-18T04:06:32Z","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 this paper, we present an exact model for the analysis of the performance of Random Linear Network Coding (RLNC) in wired erasure networks with finite buffers. In such networks, packets are delayed due to either random link erasures or blocking by full buffers. We assert that because of RLNC, the content of buffers have dependencies which cannot be captured directly using the classical queueing theoretical models. We model the performance of the network using Markov chains by a careful derivation of the buffer occupancy states and their transition rules. We verify by simulations that the pr","authors_text":"Ahmad Beirami, Badri N. Vellambi, Faramarz Fekri, Nima Torabkhani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-13T07:46:45Z","title":"Exact Modeling of the Performance of Random Linear Network Coding in Finite-buffer Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2810","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:5cf91b3b3a2ac6ba0598e2fb32f5815047cb8850545211703f960e0d3541a616","target":"record","created_at":"2026-05-18T04:06:32Z","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":"2e9ba89faa293ac0f83d41c6ff8651d622e1353b9fcfcf8deb20df9fc607f32b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-13T07:46:45Z","title_canon_sha256":"70052b6f792714ebb738b2441f31f214b543441c9edaf6ed424a064e9961d10f"},"schema_version":"1.0","source":{"id":"1112.2810","kind":"arxiv","version":1}},"canonical_sha256":"d2d76a4e4c51158a7e64a933c08d320bb8f9fd8db7c2860d033d0e417d511c07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2d76a4e4c51158a7e64a933c08d320bb8f9fd8db7c2860d033d0e417d511c07","first_computed_at":"2026-05-18T04:06:32.370157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:32.370157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rwAQ6bvqWGhtncDy4PFU5huo186zqtLJWjQHmYWmTXwgf1ZJm6loI/ON1eKkcvN8SzvbH1EyTFMOIzsCDUlDCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:32.370934Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.2810","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cf91b3b3a2ac6ba0598e2fb32f5815047cb8850545211703f960e0d3541a616","sha256:36633b9758dbddd07cb1ffbd55b59743d67cf62dc857193b7cf7a7bfb7e660d6"],"state_sha256":"0a60275762fefc826f0025bc3494d589ab28f91436d70b9390f20d41e2423bb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W6T1NGX28j/4fydtwX25k0u2laaS3BmobRlUA2DhUgFNKBuV9v/lcwI1GdwM0Vlm+Yo3xyuU5gqVvOCnhm8ZDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T12:18:43.415769Z","bundle_sha256":"c09e4c0af482caa7e224a0ebbe2ffe9c42b3814deaab2dc80f1ea513b296b07c"}}