{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BTV27KFTDCWGT4IRELUQBAUPJY","short_pith_number":"pith:BTV27KFT","canonical_record":{"source":{"id":"1103.1403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-07T22:51:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"96fa86f29d605cdbc3551bf78ca22f65dbe58bf8830689de7c3127a3b3af4604","abstract_canon_sha256":"738630c35be26e89a6a8d53c8847fc9991a2e5b6c1860810f8606482eab34c77"},"schema_version":"1.0"},"canonical_sha256":"0cebafa8b318ac69f11122e900828f4e1fe1ec6373d84bb4efe2438fa6bc22b3","source":{"kind":"arxiv","id":"1103.1403","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1403","created_at":"2026-05-18T04:27:15Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1403v1","created_at":"2026-05-18T04:27:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1403","created_at":"2026-05-18T04:27:15Z"},{"alias_kind":"pith_short_12","alias_value":"BTV27KFTDCWG","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BTV27KFTDCWGT4IR","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BTV27KFT","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BTV27KFTDCWGT4IRELUQBAUPJY","target":"record","payload":{"canonical_record":{"source":{"id":"1103.1403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-07T22:51:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"96fa86f29d605cdbc3551bf78ca22f65dbe58bf8830689de7c3127a3b3af4604","abstract_canon_sha256":"738630c35be26e89a6a8d53c8847fc9991a2e5b6c1860810f8606482eab34c77"},"schema_version":"1.0"},"canonical_sha256":"0cebafa8b318ac69f11122e900828f4e1fe1ec6373d84bb4efe2438fa6bc22b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:15.921852Z","signature_b64":"PG9LK74VTb7CGtO9pgknsxET9Uw32Xjw2sJD0NqMrEkbEll0t+6egnVF9uBJCOwM+vXa3QoXoprZt4Lzjr94AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cebafa8b318ac69f11122e900828f4e1fe1ec6373d84bb4efe2438fa6bc22b3","last_reissued_at":"2026-05-18T04:27:15.921149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:15.921149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.1403","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:27:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8RWSicYbe0RH93Vbk24+ebDxBzcrwNylpUBPKBgurt9T8Sx93i10kRcCf/9CQ6CQIx++VhSBYqIDxvRf4+iVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:48:59.092139Z"},"content_sha256":"d7238c3710cd08e1f3b1dfeb44ba4ca75a7c531c18315918eabb06526442acd0","schema_version":"1.0","event_id":"sha256:d7238c3710cd08e1f3b1dfeb44ba4ca75a7c531c18315918eabb06526442acd0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BTV27KFTDCWGT4IRELUQBAUPJY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Study of Throughput and Delay in Finite-Buffer Line Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Badri N. Vellambi, Faramarz Fekri, Nima Torabkhani","submitted_at":"2011-03-07T22:51:43Z","abstract_excerpt":"In this work, we study the effects of finite buffers on the throughput and delay of line networks with erasure links. We identify the calculation of performance parameters such as throughput and delay to be equivalent to determining the stationary distribution of an irreducible Markov chain. We note that the number of states in the Markov chain grows exponentially in the size of the buffers with the exponent scaling linearly with the number of hops in a line network. We then propose a simplified iterative scheme to approximately identify the steady-state distribution of the chain by decoupling"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1403","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:27:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J6PlR647s6vBvV22kId9IEbOZ+4u4TDVvMAz5JPuToklVW6MY+ocZRdMTZQ5gxBtHLX0QC2FsccsDnX4ZFPWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:48:59.092500Z"},"content_sha256":"1a8a58d15f545e1c4717fd58d90b0eb23958cca6ff63b5bb2a6a245b8dee6606","schema_version":"1.0","event_id":"sha256:1a8a58d15f545e1c4717fd58d90b0eb23958cca6ff63b5bb2a6a245b8dee6606"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTV27KFTDCWGT4IRELUQBAUPJY/bundle.json","state_url":"https://pith.science/pith/BTV27KFTDCWGT4IRELUQBAUPJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTV27KFTDCWGT4IRELUQBAUPJY/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:48:59Z","links":{"resolver":"https://pith.science/pith/BTV27KFTDCWGT4IRELUQBAUPJY","bundle":"https://pith.science/pith/BTV27KFTDCWGT4IRELUQBAUPJY/bundle.json","state":"https://pith.science/pith/BTV27KFTDCWGT4IRELUQBAUPJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTV27KFTDCWGT4IRELUQBAUPJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BTV27KFTDCWGT4IRELUQBAUPJY","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":"738630c35be26e89a6a8d53c8847fc9991a2e5b6c1860810f8606482eab34c77","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-07T22:51:43Z","title_canon_sha256":"96fa86f29d605cdbc3551bf78ca22f65dbe58bf8830689de7c3127a3b3af4604"},"schema_version":"1.0","source":{"id":"1103.1403","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1403","created_at":"2026-05-18T04:27:15Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1403v1","created_at":"2026-05-18T04:27:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1403","created_at":"2026-05-18T04:27:15Z"},{"alias_kind":"pith_short_12","alias_value":"BTV27KFTDCWG","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BTV27KFTDCWGT4IR","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BTV27KFT","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:1a8a58d15f545e1c4717fd58d90b0eb23958cca6ff63b5bb2a6a245b8dee6606","target":"graph","created_at":"2026-05-18T04:27:15Z","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 work, we study the effects of finite buffers on the throughput and delay of line networks with erasure links. We identify the calculation of performance parameters such as throughput and delay to be equivalent to determining the stationary distribution of an irreducible Markov chain. We note that the number of states in the Markov chain grows exponentially in the size of the buffers with the exponent scaling linearly with the number of hops in a line network. We then propose a simplified iterative scheme to approximately identify the steady-state distribution of the chain by decoupling","authors_text":"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-03-07T22:51:43Z","title":"Study of Throughput and Delay in Finite-Buffer Line Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1403","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:d7238c3710cd08e1f3b1dfeb44ba4ca75a7c531c18315918eabb06526442acd0","target":"record","created_at":"2026-05-18T04:27:15Z","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":"738630c35be26e89a6a8d53c8847fc9991a2e5b6c1860810f8606482eab34c77","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-07T22:51:43Z","title_canon_sha256":"96fa86f29d605cdbc3551bf78ca22f65dbe58bf8830689de7c3127a3b3af4604"},"schema_version":"1.0","source":{"id":"1103.1403","kind":"arxiv","version":1}},"canonical_sha256":"0cebafa8b318ac69f11122e900828f4e1fe1ec6373d84bb4efe2438fa6bc22b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cebafa8b318ac69f11122e900828f4e1fe1ec6373d84bb4efe2438fa6bc22b3","first_computed_at":"2026-05-18T04:27:15.921149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:15.921149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PG9LK74VTb7CGtO9pgknsxET9Uw32Xjw2sJD0NqMrEkbEll0t+6egnVF9uBJCOwM+vXa3QoXoprZt4Lzjr94AA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:15.921852Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.1403","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7238c3710cd08e1f3b1dfeb44ba4ca75a7c531c18315918eabb06526442acd0","sha256:1a8a58d15f545e1c4717fd58d90b0eb23958cca6ff63b5bb2a6a245b8dee6606"],"state_sha256":"38d027a27b81873b152c9999b354f9dd67eda3827145474a501d5dbdeb731499"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l+ZlCjWu4zp3Zz/52VCYfGN0tWqSRrtT3zx2RBteufwK8WT+zGV3qy8VJaywnBJylKKYf3MbcMmV7WcPAvX6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T12:48:59.094669Z","bundle_sha256":"41d3083416a72f2bba5a104c32d83eb3a79562137bc2f9e3a676a3978c2ff886"}}