{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VANCNEWFR43NZMVLAKYXRZGDND","short_pith_number":"pith:VANCNEWF","schema_version":"1.0","canonical_sha256":"a81a2692c58f36dcb2ab02b178e4c368ff83e588bbf400ecd388cfc388ebbfb3","source":{"kind":"arxiv","id":"1012.2628","version":1},"attestation_state":"computed","paper":{"title":"Throughput and Latency 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":"2010-12-13T04:14:12Z","abstract_excerpt":"This work investigates the effect of finite buffer sizes on the throughput capacity and packet delay of line networks with packet erasure links that have perfect feedback. These performance measures are shown to be linked to the stationary distribution of an underlying irreducible Markov chain that models the system exactly. Using simple strategies, bounds on the throughput capacity are derived. The work then presents two iterative schemes to approximate the steady-state distribution of node occupancies by decoupling the chain to smaller queueing blocks. These approximate solutions are used to"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1012.2628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-13T04:14:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"548ced124f2129d29750beb76e8025c89542bca5004e97536ac6a2a34adc6a4e","abstract_canon_sha256":"76b46ea71e5f34c2157597b7dbdd3bacab564fd67ca0ef7febae17d16c008d5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:10.577194Z","signature_b64":"2ddhjRT12rkOuy8VQARFungvHuYAZNw7fl9VLHXwZlzkYdZF4N31BKlPNyJcy+rPh7AsVSoBLCG0e1tJq5toBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a81a2692c58f36dcb2ab02b178e4c368ff83e588bbf400ecd388cfc388ebbfb3","last_reissued_at":"2026-05-18T00:59:10.576599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:10.576599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Throughput and Latency 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":"2010-12-13T04:14:12Z","abstract_excerpt":"This work investigates the effect of finite buffer sizes on the throughput capacity and packet delay of line networks with packet erasure links that have perfect feedback. These performance measures are shown to be linked to the stationary distribution of an underlying irreducible Markov chain that models the system exactly. Using simple strategies, bounds on the throughput capacity are derived. The work then presents two iterative schemes to approximate the steady-state distribution of node occupancies by decoupling the chain to smaller queueing blocks. These approximate solutions are used to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2628","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1012.2628","created_at":"2026-05-18T00:59:10.576700+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.2628v1","created_at":"2026-05-18T00:59:10.576700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2628","created_at":"2026-05-18T00:59:10.576700+00:00"},{"alias_kind":"pith_short_12","alias_value":"VANCNEWFR43N","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VANCNEWFR43NZMVL","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VANCNEWF","created_at":"2026-05-18T12:26:15.391820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VANCNEWFR43NZMVLAKYXRZGDND","json":"https://pith.science/pith/VANCNEWFR43NZMVLAKYXRZGDND.json","graph_json":"https://pith.science/api/pith-number/VANCNEWFR43NZMVLAKYXRZGDND/graph.json","events_json":"https://pith.science/api/pith-number/VANCNEWFR43NZMVLAKYXRZGDND/events.json","paper":"https://pith.science/paper/VANCNEWF"},"agent_actions":{"view_html":"https://pith.science/pith/VANCNEWFR43NZMVLAKYXRZGDND","download_json":"https://pith.science/pith/VANCNEWFR43NZMVLAKYXRZGDND.json","view_paper":"https://pith.science/paper/VANCNEWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.2628&json=true","fetch_graph":"https://pith.science/api/pith-number/VANCNEWFR43NZMVLAKYXRZGDND/graph.json","fetch_events":"https://pith.science/api/pith-number/VANCNEWFR43NZMVLAKYXRZGDND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VANCNEWFR43NZMVLAKYXRZGDND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VANCNEWFR43NZMVLAKYXRZGDND/action/storage_attestation","attest_author":"https://pith.science/pith/VANCNEWFR43NZMVLAKYXRZGDND/action/author_attestation","sign_citation":"https://pith.science/pith/VANCNEWFR43NZMVLAKYXRZGDND/action/citation_signature","submit_replication":"https://pith.science/pith/VANCNEWFR43NZMVLAKYXRZGDND/action/replication_record"}},"created_at":"2026-05-18T00:59:10.576700+00:00","updated_at":"2026-05-18T00:59:10.576700+00:00"}