{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ICG5IRTSI4SSCYDROCWUJJQSRA","short_pith_number":"pith:ICG5IRTS","schema_version":"1.0","canonical_sha256":"408dd44672472521607170ad44a612880d26106063e7a4bf9df5eb14a159d53b","source":{"kind":"arxiv","id":"1702.08539","version":1},"attestation_state":"computed","paper":{"title":"Non-Concave Network Utility Maximization in Connectionless Networks: A Fully Distributed Traffic Allocation Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Constantino Lagoa, Hao Che, Jingyao Wang, Mahmoud Ashour, Necdet Aybat, Zhisheng Duan","submitted_at":"2017-02-27T21:32:59Z","abstract_excerpt":"This paper considers the optimization-based traffic allocation problem among multiple end points in connectionless networks. The network utility function is modeled as a non-concave function, since it is the best description of the quality of service perceived by users with inelastic applications, such as video and audio streaming. However, the resulting non-convex optimization problem, is challenging and requires new analysis and solution techniques. To overcome these challenges, we first propose a hierarchy of problems whose optimal value converges to the optimal value of the non-convex opti"},"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":"1702.08539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-27T21:32:59Z","cross_cats_sorted":[],"title_canon_sha256":"96aedaaa88d43e2d2060ae1dc104eba5e7736c13e4afaf70a2317c759c199e3e","abstract_canon_sha256":"344cbe810788300a5cb5f4d54bda54ebae7fe2af48044775fc28fec6425b56d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:48.450094Z","signature_b64":"OLzx0idCnvsxm+MXBgXHVE5UtIX8GcM+OTyWfTH5HfOaeJq87Z0t73oG2rGQnIAbDZi2eU3B32saQye4JxACAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"408dd44672472521607170ad44a612880d26106063e7a4bf9df5eb14a159d53b","last_reissued_at":"2026-05-18T00:49:48.449443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:48.449443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Concave Network Utility Maximization in Connectionless Networks: A Fully Distributed Traffic Allocation Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Constantino Lagoa, Hao Che, Jingyao Wang, Mahmoud Ashour, Necdet Aybat, Zhisheng Duan","submitted_at":"2017-02-27T21:32:59Z","abstract_excerpt":"This paper considers the optimization-based traffic allocation problem among multiple end points in connectionless networks. The network utility function is modeled as a non-concave function, since it is the best description of the quality of service perceived by users with inelastic applications, such as video and audio streaming. However, the resulting non-convex optimization problem, is challenging and requires new analysis and solution techniques. To overcome these challenges, we first propose a hierarchy of problems whose optimal value converges to the optimal value of the non-convex opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08539","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":"1702.08539","created_at":"2026-05-18T00:49:48.449544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.08539v1","created_at":"2026-05-18T00:49:48.449544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08539","created_at":"2026-05-18T00:49:48.449544+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICG5IRTSI4SS","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICG5IRTSI4SSCYDR","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICG5IRTS","created_at":"2026-05-18T12:31:21.493067+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/ICG5IRTSI4SSCYDROCWUJJQSRA","json":"https://pith.science/pith/ICG5IRTSI4SSCYDROCWUJJQSRA.json","graph_json":"https://pith.science/api/pith-number/ICG5IRTSI4SSCYDROCWUJJQSRA/graph.json","events_json":"https://pith.science/api/pith-number/ICG5IRTSI4SSCYDROCWUJJQSRA/events.json","paper":"https://pith.science/paper/ICG5IRTS"},"agent_actions":{"view_html":"https://pith.science/pith/ICG5IRTSI4SSCYDROCWUJJQSRA","download_json":"https://pith.science/pith/ICG5IRTSI4SSCYDROCWUJJQSRA.json","view_paper":"https://pith.science/paper/ICG5IRTS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.08539&json=true","fetch_graph":"https://pith.science/api/pith-number/ICG5IRTSI4SSCYDROCWUJJQSRA/graph.json","fetch_events":"https://pith.science/api/pith-number/ICG5IRTSI4SSCYDROCWUJJQSRA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICG5IRTSI4SSCYDROCWUJJQSRA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICG5IRTSI4SSCYDROCWUJJQSRA/action/storage_attestation","attest_author":"https://pith.science/pith/ICG5IRTSI4SSCYDROCWUJJQSRA/action/author_attestation","sign_citation":"https://pith.science/pith/ICG5IRTSI4SSCYDROCWUJJQSRA/action/citation_signature","submit_replication":"https://pith.science/pith/ICG5IRTSI4SSCYDROCWUJJQSRA/action/replication_record"}},"created_at":"2026-05-18T00:49:48.449544+00:00","updated_at":"2026-05-18T00:49:48.449544+00:00"}