{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QCLMN4FLJGJCW4RLCQV4P4OZM3","short_pith_number":"pith:QCLMN4FL","schema_version":"1.0","canonical_sha256":"8096c6f0ab49922b722b142bc7f1d966ce9d202f5f2cc611d216cb2614459fa4","source":{"kind":"arxiv","id":"1109.6809","version":1},"attestation_state":"computed","paper":{"title":"NUM-Based Rate Allocation for Streaming Traffic via Sequential Convex Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NI","authors_text":"Ahmad Khonsari, Ali Sehati, Mohammad Sadegh Talebi","submitted_at":"2011-09-30T12:41:59Z","abstract_excerpt":"In recent years, there has been an increasing demand for ubiquitous streaming like applications in data networks. In this paper, we concentrate on NUM-based rate allocation for streaming applications with the so-called S-curve utility functions. Due to non-concavity of such utility functions, the underlying NUM problem would be non-convex for which dual methods might become quite useless. To tackle the non-convex problem, using elementary techniques we make the utility of the network concave, however this results in reverse-convex constraints which make the problem non-convex. To deal with suc"},"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":"1109.6809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-09-30T12:41:59Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"adcfe8fcf0080f0dee8d669fb1c5b7542133b6a6f5cbf1b454e11bded5dc878c","abstract_canon_sha256":"7bf13f9bc3fc5b3dd836e96a792f25c2ba5a31d0a2fb8af9dc51855dd4193508"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:35.915515Z","signature_b64":"GtdSp96YQRFC9j3PvacvKAccWMaeqdUpElly2SZqF43T379xgpyrvs86jXfrUc7JE5wbjQsrtHfaLrNq/tZjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8096c6f0ab49922b722b142bc7f1d966ce9d202f5f2cc611d216cb2614459fa4","last_reissued_at":"2026-05-18T02:21:35.914886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:35.914886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NUM-Based Rate Allocation for Streaming Traffic via Sequential Convex Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NI","authors_text":"Ahmad Khonsari, Ali Sehati, Mohammad Sadegh Talebi","submitted_at":"2011-09-30T12:41:59Z","abstract_excerpt":"In recent years, there has been an increasing demand for ubiquitous streaming like applications in data networks. In this paper, we concentrate on NUM-based rate allocation for streaming applications with the so-called S-curve utility functions. Due to non-concavity of such utility functions, the underlying NUM problem would be non-convex for which dual methods might become quite useless. To tackle the non-convex problem, using elementary techniques we make the utility of the network concave, however this results in reverse-convex constraints which make the problem non-convex. To deal with suc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6809","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":"1109.6809","created_at":"2026-05-18T02:21:35.914987+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.6809v1","created_at":"2026-05-18T02:21:35.914987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6809","created_at":"2026-05-18T02:21:35.914987+00:00"},{"alias_kind":"pith_short_12","alias_value":"QCLMN4FLJGJC","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QCLMN4FLJGJCW4RL","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QCLMN4FL","created_at":"2026-05-18T12:26:39.201973+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/QCLMN4FLJGJCW4RLCQV4P4OZM3","json":"https://pith.science/pith/QCLMN4FLJGJCW4RLCQV4P4OZM3.json","graph_json":"https://pith.science/api/pith-number/QCLMN4FLJGJCW4RLCQV4P4OZM3/graph.json","events_json":"https://pith.science/api/pith-number/QCLMN4FLJGJCW4RLCQV4P4OZM3/events.json","paper":"https://pith.science/paper/QCLMN4FL"},"agent_actions":{"view_html":"https://pith.science/pith/QCLMN4FLJGJCW4RLCQV4P4OZM3","download_json":"https://pith.science/pith/QCLMN4FLJGJCW4RLCQV4P4OZM3.json","view_paper":"https://pith.science/paper/QCLMN4FL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.6809&json=true","fetch_graph":"https://pith.science/api/pith-number/QCLMN4FLJGJCW4RLCQV4P4OZM3/graph.json","fetch_events":"https://pith.science/api/pith-number/QCLMN4FLJGJCW4RLCQV4P4OZM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QCLMN4FLJGJCW4RLCQV4P4OZM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QCLMN4FLJGJCW4RLCQV4P4OZM3/action/storage_attestation","attest_author":"https://pith.science/pith/QCLMN4FLJGJCW4RLCQV4P4OZM3/action/author_attestation","sign_citation":"https://pith.science/pith/QCLMN4FLJGJCW4RLCQV4P4OZM3/action/citation_signature","submit_replication":"https://pith.science/pith/QCLMN4FLJGJCW4RLCQV4P4OZM3/action/replication_record"}},"created_at":"2026-05-18T02:21:35.914987+00:00","updated_at":"2026-05-18T02:21:35.914987+00:00"}