{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SEHJKNPNT2FD53D4SOMVWGKJPL","short_pith_number":"pith:SEHJKNPN","schema_version":"1.0","canonical_sha256":"910e9535ed9e8a3eec7c93995b19497ae3403fafb594b824540a2ad6685755b2","source":{"kind":"arxiv","id":"1501.03457","version":1},"attestation_state":"computed","paper":{"title":"Achieving Utility-Delay-Reliability Tradeoff in Stochastic Network Optimization with Finite Buffers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael J. Neely, Sucha Supittayapornpong","submitted_at":"2015-01-14T19:25:28Z","abstract_excerpt":"One practical open problem is the development of a distributed algorithm that achieves near-optimal utility using only a finite (and small) buffer size for queues in a stochastic network. This paper studies utility maximization (or cost minimization) in a finite-buffer regime and considers the corresponding delay and reliability (or rate of packet drops) tradeoff. A floating-queue algorithm allows the stochastic network optimization framework to be implemented with finite buffers at the cost of packet drops. Further, the buffer size requirement is significantly smaller than previous works in t"},"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":"1501.03457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-14T19:25:28Z","cross_cats_sorted":[],"title_canon_sha256":"6c296f05914ab298ee2e95f772c40be1f12ad9ab2519f42f5f89cb2ed0ef0f04","abstract_canon_sha256":"b57c6693aebebceaa417d1f4883e7f4d21bbd0e9e004dd473ed095a7499aec04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:23.989272Z","signature_b64":"mIWhrEn9JxAC02zEZoyI8yzA0nOVVTM++edagMZYXqo38mkHRghrDVd60X/H93AEgGV+YRZQ0XrjgT7N421JDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"910e9535ed9e8a3eec7c93995b19497ae3403fafb594b824540a2ad6685755b2","last_reissued_at":"2026-05-18T02:29:23.988691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:23.988691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achieving Utility-Delay-Reliability Tradeoff in Stochastic Network Optimization with Finite Buffers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael J. Neely, Sucha Supittayapornpong","submitted_at":"2015-01-14T19:25:28Z","abstract_excerpt":"One practical open problem is the development of a distributed algorithm that achieves near-optimal utility using only a finite (and small) buffer size for queues in a stochastic network. This paper studies utility maximization (or cost minimization) in a finite-buffer regime and considers the corresponding delay and reliability (or rate of packet drops) tradeoff. A floating-queue algorithm allows the stochastic network optimization framework to be implemented with finite buffers at the cost of packet drops. Further, the buffer size requirement is significantly smaller than previous works in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03457","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":"1501.03457","created_at":"2026-05-18T02:29:23.988784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.03457v1","created_at":"2026-05-18T02:29:23.988784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03457","created_at":"2026-05-18T02:29:23.988784+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEHJKNPNT2FD","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEHJKNPNT2FD53D4","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEHJKNPN","created_at":"2026-05-18T12:29:39.896362+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/SEHJKNPNT2FD53D4SOMVWGKJPL","json":"https://pith.science/pith/SEHJKNPNT2FD53D4SOMVWGKJPL.json","graph_json":"https://pith.science/api/pith-number/SEHJKNPNT2FD53D4SOMVWGKJPL/graph.json","events_json":"https://pith.science/api/pith-number/SEHJKNPNT2FD53D4SOMVWGKJPL/events.json","paper":"https://pith.science/paper/SEHJKNPN"},"agent_actions":{"view_html":"https://pith.science/pith/SEHJKNPNT2FD53D4SOMVWGKJPL","download_json":"https://pith.science/pith/SEHJKNPNT2FD53D4SOMVWGKJPL.json","view_paper":"https://pith.science/paper/SEHJKNPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.03457&json=true","fetch_graph":"https://pith.science/api/pith-number/SEHJKNPNT2FD53D4SOMVWGKJPL/graph.json","fetch_events":"https://pith.science/api/pith-number/SEHJKNPNT2FD53D4SOMVWGKJPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEHJKNPNT2FD53D4SOMVWGKJPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEHJKNPNT2FD53D4SOMVWGKJPL/action/storage_attestation","attest_author":"https://pith.science/pith/SEHJKNPNT2FD53D4SOMVWGKJPL/action/author_attestation","sign_citation":"https://pith.science/pith/SEHJKNPNT2FD53D4SOMVWGKJPL/action/citation_signature","submit_replication":"https://pith.science/pith/SEHJKNPNT2FD53D4SOMVWGKJPL/action/replication_record"}},"created_at":"2026-05-18T02:29:23.988784+00:00","updated_at":"2026-05-18T02:29:23.988784+00:00"}