{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ICG5IRTSI4SSCYDROCWUJJQSRA","short_pith_number":"pith:ICG5IRTS","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"},"canonical_sha256":"408dd44672472521607170ad44a612880d26106063e7a4bf9df5eb14a159d53b","source":{"kind":"arxiv","id":"1702.08539","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08539","created_at":"2026-05-18T00:49:48Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08539v1","created_at":"2026-05-18T00:49:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08539","created_at":"2026-05-18T00:49:48Z"},{"alias_kind":"pith_short_12","alias_value":"ICG5IRTSI4SS","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"ICG5IRTSI4SSCYDR","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"ICG5IRTS","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ICG5IRTSI4SSCYDROCWUJJQSRA","target":"record","payload":{"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"},"canonical_sha256":"408dd44672472521607170ad44a612880d26106063e7a4bf9df5eb14a159d53b","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"},"source_kind":"arxiv","source_id":"1702.08539","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-18T00:49:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gCsxIVPoZqRCIDFB778vV3IYrE2YuCqu0ztJrcyjv3bQ7wU6RwtZyQhc8EkjgKMvEwPJzxt+rPv5solgKReBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:16:06.519450Z"},"content_sha256":"d0e603792a4d6b771c66d506e93d46ab253933c95913931d4c8f351057e5f103","schema_version":"1.0","event_id":"sha256:d0e603792a4d6b771c66d506e93d46ab253933c95913931d4c8f351057e5f103"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ICG5IRTSI4SSCYDROCWUJJQSRA","target":"graph","payload":{"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"},"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-18T00:49:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OKfAOjkjpszt9vl8JGsD7qqsW0bPPUV8tYzHu/xoWosvNocMT4RhdWQUIn2yq9Dk8nT1XoRIeXlDbbPSG9D8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:16:06.520117Z"},"content_sha256":"170a2ad3122b6cd8cb4681cf0a66c5271f2d8aba2c688c2e61179a7c5ec6b1da","schema_version":"1.0","event_id":"sha256:170a2ad3122b6cd8cb4681cf0a66c5271f2d8aba2c688c2e61179a7c5ec6b1da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ICG5IRTSI4SSCYDROCWUJJQSRA/bundle.json","state_url":"https://pith.science/pith/ICG5IRTSI4SSCYDROCWUJJQSRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ICG5IRTSI4SSCYDROCWUJJQSRA/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-05-25T17:16:06Z","links":{"resolver":"https://pith.science/pith/ICG5IRTSI4SSCYDROCWUJJQSRA","bundle":"https://pith.science/pith/ICG5IRTSI4SSCYDROCWUJJQSRA/bundle.json","state":"https://pith.science/pith/ICG5IRTSI4SSCYDROCWUJJQSRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ICG5IRTSI4SSCYDROCWUJJQSRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ICG5IRTSI4SSCYDROCWUJJQSRA","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":"344cbe810788300a5cb5f4d54bda54ebae7fe2af48044775fc28fec6425b56d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-27T21:32:59Z","title_canon_sha256":"96aedaaa88d43e2d2060ae1dc104eba5e7736c13e4afaf70a2317c759c199e3e"},"schema_version":"1.0","source":{"id":"1702.08539","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08539","created_at":"2026-05-18T00:49:48Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08539v1","created_at":"2026-05-18T00:49:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08539","created_at":"2026-05-18T00:49:48Z"},{"alias_kind":"pith_short_12","alias_value":"ICG5IRTSI4SS","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"ICG5IRTSI4SSCYDR","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"ICG5IRTS","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:170a2ad3122b6cd8cb4681cf0a66c5271f2d8aba2c688c2e61179a7c5ec6b1da","target":"graph","created_at":"2026-05-18T00:49:48Z","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":"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","authors_text":"Constantino Lagoa, Hao Che, Jingyao Wang, Mahmoud Ashour, Necdet Aybat, Zhisheng Duan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-27T21:32:59Z","title":"Non-Concave Network Utility Maximization in Connectionless Networks: A Fully Distributed Traffic Allocation Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08539","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:d0e603792a4d6b771c66d506e93d46ab253933c95913931d4c8f351057e5f103","target":"record","created_at":"2026-05-18T00:49:48Z","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":"344cbe810788300a5cb5f4d54bda54ebae7fe2af48044775fc28fec6425b56d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-27T21:32:59Z","title_canon_sha256":"96aedaaa88d43e2d2060ae1dc104eba5e7736c13e4afaf70a2317c759c199e3e"},"schema_version":"1.0","source":{"id":"1702.08539","kind":"arxiv","version":1}},"canonical_sha256":"408dd44672472521607170ad44a612880d26106063e7a4bf9df5eb14a159d53b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"408dd44672472521607170ad44a612880d26106063e7a4bf9df5eb14a159d53b","first_computed_at":"2026-05-18T00:49:48.449443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:48.449443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OLzx0idCnvsxm+MXBgXHVE5UtIX8GcM+OTyWfTH5HfOaeJq87Z0t73oG2rGQnIAbDZi2eU3B32saQye4JxACAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:48.450094Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08539","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0e603792a4d6b771c66d506e93d46ab253933c95913931d4c8f351057e5f103","sha256:170a2ad3122b6cd8cb4681cf0a66c5271f2d8aba2c688c2e61179a7c5ec6b1da"],"state_sha256":"ec810f6308edbf4e2c22caa6e0a3cf60a4339e0e2fc0154d1118109ffbe03cb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LRN1Bw2IsJuybdsBFZn52SXU99z8P58IzceLA28HRQhwxGmzZs8hoCMW94vlY9843SW7BV1fBrq86T1h6L40Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:16:06.523865Z","bundle_sha256":"3480c598e7e88f8e04df94801f699a0472e5b25b76684b60d873a1dce3526879"}}