{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NGXUCNEM3BUOLUUDEGA32Z4OVB","short_pith_number":"pith:NGXUCNEM","schema_version":"1.0","canonical_sha256":"69af41348cd868e5d2832181bd678ea8659bd5f9705e139f07444b4d9491a1d9","source":{"kind":"arxiv","id":"1812.06169","version":3},"attestation_state":"computed","paper":{"title":"Network Utility Maximization under Maximum Delay Constraints and Throughput Requirements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Haibo Zeng, Minghua Chen, Qingyu Liu","submitted_at":"2018-12-14T21:19:27Z","abstract_excerpt":"We consider the problem of maximizing aggregate user utilities over a multi-hop network, subject to link capacity constraints, maximum end-to-end delay constraints, and user throughput requirements. A user's utility is a concave function of the achieved throughput or the experienced maximum delay. The problem is important for supporting real-time multimedia traffic, and is uniquely challenging due to the need of simultaneously considering maximum delay constraints and throughput requirements. We first show that it is NP-complete either (i) to construct a feasible solution strictly meeting all "},"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":"1812.06169","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-14T21:19:27Z","cross_cats_sorted":[],"title_canon_sha256":"7b52e99139ee7b640695440289be3fead15be778ab333d9e7ccd94e959e8481a","abstract_canon_sha256":"64a6bb0c83ab1d483b145e791b4ceeaa468206f51ea7f71f19775e0b6e579f4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:30.571261Z","signature_b64":"fs/EwM8L0IDmnrAHNpgIl20nwHA91OCaz26Fqjvw4oxi6SK7VlVOatDwaDVKJDmpBGkyOQzKat4jrbLBosJjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69af41348cd868e5d2832181bd678ea8659bd5f9705e139f07444b4d9491a1d9","last_reissued_at":"2026-05-17T23:57:30.570600Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:30.570600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Utility Maximization under Maximum Delay Constraints and Throughput Requirements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Haibo Zeng, Minghua Chen, Qingyu Liu","submitted_at":"2018-12-14T21:19:27Z","abstract_excerpt":"We consider the problem of maximizing aggregate user utilities over a multi-hop network, subject to link capacity constraints, maximum end-to-end delay constraints, and user throughput requirements. A user's utility is a concave function of the achieved throughput or the experienced maximum delay. The problem is important for supporting real-time multimedia traffic, and is uniquely challenging due to the need of simultaneously considering maximum delay constraints and throughput requirements. We first show that it is NP-complete either (i) to construct a feasible solution strictly meeting all "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06169","kind":"arxiv","version":3},"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":"1812.06169","created_at":"2026-05-17T23:57:30.570698+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.06169v3","created_at":"2026-05-17T23:57:30.570698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06169","created_at":"2026-05-17T23:57:30.570698+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGXUCNEM3BUO","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGXUCNEM3BUOLUUD","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGXUCNEM","created_at":"2026-05-18T12:32:40.477152+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/NGXUCNEM3BUOLUUDEGA32Z4OVB","json":"https://pith.science/pith/NGXUCNEM3BUOLUUDEGA32Z4OVB.json","graph_json":"https://pith.science/api/pith-number/NGXUCNEM3BUOLUUDEGA32Z4OVB/graph.json","events_json":"https://pith.science/api/pith-number/NGXUCNEM3BUOLUUDEGA32Z4OVB/events.json","paper":"https://pith.science/paper/NGXUCNEM"},"agent_actions":{"view_html":"https://pith.science/pith/NGXUCNEM3BUOLUUDEGA32Z4OVB","download_json":"https://pith.science/pith/NGXUCNEM3BUOLUUDEGA32Z4OVB.json","view_paper":"https://pith.science/paper/NGXUCNEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.06169&json=true","fetch_graph":"https://pith.science/api/pith-number/NGXUCNEM3BUOLUUDEGA32Z4OVB/graph.json","fetch_events":"https://pith.science/api/pith-number/NGXUCNEM3BUOLUUDEGA32Z4OVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGXUCNEM3BUOLUUDEGA32Z4OVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGXUCNEM3BUOLUUDEGA32Z4OVB/action/storage_attestation","attest_author":"https://pith.science/pith/NGXUCNEM3BUOLUUDEGA32Z4OVB/action/author_attestation","sign_citation":"https://pith.science/pith/NGXUCNEM3BUOLUUDEGA32Z4OVB/action/citation_signature","submit_replication":"https://pith.science/pith/NGXUCNEM3BUOLUUDEGA32Z4OVB/action/replication_record"}},"created_at":"2026-05-17T23:57:30.570698+00:00","updated_at":"2026-05-17T23:57:30.570698+00:00"}