{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QCLMN4FLJGJCW4RLCQV4P4OZM3","short_pith_number":"pith:QCLMN4FL","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"},"canonical_sha256":"8096c6f0ab49922b722b142bc7f1d966ce9d202f5f2cc611d216cb2614459fa4","source":{"kind":"arxiv","id":"1109.6809","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6809","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6809v1","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6809","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"QCLMN4FLJGJC","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QCLMN4FLJGJCW4RL","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QCLMN4FL","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QCLMN4FLJGJCW4RLCQV4P4OZM3","target":"record","payload":{"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"},"canonical_sha256":"8096c6f0ab49922b722b142bc7f1d966ce9d202f5f2cc611d216cb2614459fa4","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"},"source_kind":"arxiv","source_id":"1109.6809","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6MkTgalouLZ0rcVNbrZs4sSrJAWTbUsLIuzvByE0McOxuK2hfNa83bCbmbv3YZxn0DSOiZSjNwu+4EcTY+HiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:15:20.833972Z"},"content_sha256":"ab671b8313b5b8f6256235a2aebe6ed15b127802ecd710acf42be51ccb42d35f","schema_version":"1.0","event_id":"sha256:ab671b8313b5b8f6256235a2aebe6ed15b127802ecd710acf42be51ccb42d35f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QCLMN4FLJGJCW4RLCQV4P4OZM3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zjHJenNKDzrmzQmmWzmtFIq2gXF6aSM59iuNKB6Yo4Lj2OZ84dNZ867ffyk2mkePgH7IM4jjISqA93oqfiocCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:15:20.834704Z"},"content_sha256":"130a1490dcdbba8c45801f772da762528cb69174fc9e9942378621960de71f81","schema_version":"1.0","event_id":"sha256:130a1490dcdbba8c45801f772da762528cb69174fc9e9942378621960de71f81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QCLMN4FLJGJCW4RLCQV4P4OZM3/bundle.json","state_url":"https://pith.science/pith/QCLMN4FLJGJCW4RLCQV4P4OZM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QCLMN4FLJGJCW4RLCQV4P4OZM3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T14:15:20Z","links":{"resolver":"https://pith.science/pith/QCLMN4FLJGJCW4RLCQV4P4OZM3","bundle":"https://pith.science/pith/QCLMN4FLJGJCW4RLCQV4P4OZM3/bundle.json","state":"https://pith.science/pith/QCLMN4FLJGJCW4RLCQV4P4OZM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QCLMN4FLJGJCW4RLCQV4P4OZM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QCLMN4FLJGJCW4RLCQV4P4OZM3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7bf13f9bc3fc5b3dd836e96a792f25c2ba5a31d0a2fb8af9dc51855dd4193508","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-09-30T12:41:59Z","title_canon_sha256":"adcfe8fcf0080f0dee8d669fb1c5b7542133b6a6f5cbf1b454e11bded5dc878c"},"schema_version":"1.0","source":{"id":"1109.6809","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6809","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6809v1","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6809","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"QCLMN4FLJGJC","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QCLMN4FLJGJCW4RL","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QCLMN4FL","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:130a1490dcdbba8c45801f772da762528cb69174fc9e9942378621960de71f81","target":"graph","created_at":"2026-05-18T02:21:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ahmad Khonsari, Ali Sehati, Mohammad Sadegh Talebi","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-09-30T12:41:59Z","title":"NUM-Based Rate Allocation for Streaming Traffic via Sequential Convex Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6809","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ab671b8313b5b8f6256235a2aebe6ed15b127802ecd710acf42be51ccb42d35f","target":"record","created_at":"2026-05-18T02:21:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7bf13f9bc3fc5b3dd836e96a792f25c2ba5a31d0a2fb8af9dc51855dd4193508","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-09-30T12:41:59Z","title_canon_sha256":"adcfe8fcf0080f0dee8d669fb1c5b7542133b6a6f5cbf1b454e11bded5dc878c"},"schema_version":"1.0","source":{"id":"1109.6809","kind":"arxiv","version":1}},"canonical_sha256":"8096c6f0ab49922b722b142bc7f1d966ce9d202f5f2cc611d216cb2614459fa4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8096c6f0ab49922b722b142bc7f1d966ce9d202f5f2cc611d216cb2614459fa4","first_computed_at":"2026-05-18T02:21:35.914886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:35.914886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GtdSp96YQRFC9j3PvacvKAccWMaeqdUpElly2SZqF43T379xgpyrvs86jXfrUc7JE5wbjQsrtHfaLrNq/tZjCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:35.915515Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.6809","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab671b8313b5b8f6256235a2aebe6ed15b127802ecd710acf42be51ccb42d35f","sha256:130a1490dcdbba8c45801f772da762528cb69174fc9e9942378621960de71f81"],"state_sha256":"16bf98f40f6adf2c5822621ff9db59a3ee83806789f1bbd14d3eba97c91f4f96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SBj2GZg9QKKMsHec8KnznVj1Q7nZwWNFe//fBrvrHYfTcRXqXbE3upUQ50NR+klO6jy6ri2GMcnjEQcLm2J9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:15:20.838137Z","bundle_sha256":"a113607d22eb516bad036d00689f3b505b593d9012ff52bf78e828f9e31cd21e"}}