{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OY54AD67HOQMFNYGO73FZMAXPH","short_pith_number":"pith:OY54AD67","schema_version":"1.0","canonical_sha256":"763bc00fdf3ba0c2b70677f65cb01779d71578f8e67d16fd8f4448d3ac4489bd","source":{"kind":"arxiv","id":"1509.03374","version":2},"attestation_state":"computed","paper":{"title":"Utility-Optimal Dynamic Rate Allocation under Average End-to-End Delay Requirements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahmad Khonsari, Mohammad H. Hajiesmaili, Mohammad Sadegh Talebi","submitted_at":"2015-09-11T02:18:51Z","abstract_excerpt":"QoS-aware networking applications such as real-time streaming and video surveillance systems require nearly fixed average end-to-end delay over long periods to communicate efficiently, although may tolerate some delay variations in short periods. This variability exhibits complex dynamics that makes rate control of such applications a formidable task. This paper addresses rate allocation for heterogeneous QoS-aware applications that preserves the long-term end-to-end delay constraint while, similar to Dynamic Network Utility Maximization (DNUM), strives to achieve the maximum network utility a"},"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":"1509.03374","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-11T02:18:51Z","cross_cats_sorted":[],"title_canon_sha256":"ad48858f2965176547871cf4a6d64e23aa14001417ec69ee2937c00149fb50fa","abstract_canon_sha256":"447e888999ac9cfdd1e6117d7ff25a7a223bac635cd97a6a1a3f4ce6b23d4c5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:25.081678Z","signature_b64":"1ZAu1Ntvq3DubfCKhPgqTeT5+krO73CW5b2qcgD9y30J5Bul3x7n0sDvkpQadGcB2CYK4drO2nxAE2ONs5IKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"763bc00fdf3ba0c2b70677f65cb01779d71578f8e67d16fd8f4448d3ac4489bd","last_reissued_at":"2026-05-18T01:28:25.080986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:25.080986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Utility-Optimal Dynamic Rate Allocation under Average End-to-End Delay Requirements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahmad Khonsari, Mohammad H. Hajiesmaili, Mohammad Sadegh Talebi","submitted_at":"2015-09-11T02:18:51Z","abstract_excerpt":"QoS-aware networking applications such as real-time streaming and video surveillance systems require nearly fixed average end-to-end delay over long periods to communicate efficiently, although may tolerate some delay variations in short periods. This variability exhibits complex dynamics that makes rate control of such applications a formidable task. This paper addresses rate allocation for heterogeneous QoS-aware applications that preserves the long-term end-to-end delay constraint while, similar to Dynamic Network Utility Maximization (DNUM), strives to achieve the maximum network utility a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03374","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.03374","created_at":"2026-05-18T01:28:25.081120+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.03374v2","created_at":"2026-05-18T01:28:25.081120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03374","created_at":"2026-05-18T01:28:25.081120+00:00"},{"alias_kind":"pith_short_12","alias_value":"OY54AD67HOQM","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OY54AD67HOQMFNYG","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OY54AD67","created_at":"2026-05-18T12:29:34.919912+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/OY54AD67HOQMFNYGO73FZMAXPH","json":"https://pith.science/pith/OY54AD67HOQMFNYGO73FZMAXPH.json","graph_json":"https://pith.science/api/pith-number/OY54AD67HOQMFNYGO73FZMAXPH/graph.json","events_json":"https://pith.science/api/pith-number/OY54AD67HOQMFNYGO73FZMAXPH/events.json","paper":"https://pith.science/paper/OY54AD67"},"agent_actions":{"view_html":"https://pith.science/pith/OY54AD67HOQMFNYGO73FZMAXPH","download_json":"https://pith.science/pith/OY54AD67HOQMFNYGO73FZMAXPH.json","view_paper":"https://pith.science/paper/OY54AD67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.03374&json=true","fetch_graph":"https://pith.science/api/pith-number/OY54AD67HOQMFNYGO73FZMAXPH/graph.json","fetch_events":"https://pith.science/api/pith-number/OY54AD67HOQMFNYGO73FZMAXPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OY54AD67HOQMFNYGO73FZMAXPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OY54AD67HOQMFNYGO73FZMAXPH/action/storage_attestation","attest_author":"https://pith.science/pith/OY54AD67HOQMFNYGO73FZMAXPH/action/author_attestation","sign_citation":"https://pith.science/pith/OY54AD67HOQMFNYGO73FZMAXPH/action/citation_signature","submit_replication":"https://pith.science/pith/OY54AD67HOQMFNYGO73FZMAXPH/action/replication_record"}},"created_at":"2026-05-18T01:28:25.081120+00:00","updated_at":"2026-05-18T01:28:25.081120+00:00"}