{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VG3KO7UBFGQDOQPN7Q45YPUXRV","short_pith_number":"pith:VG3KO7UB","schema_version":"1.0","canonical_sha256":"a9b6a77e8129a03741edfc39dc3e978d5bfccfe7211f2669238b42d0df2dec01","source":{"kind":"arxiv","id":"2509.10722","version":1},"attestation_state":"computed","paper":{"title":"Large-Scale Network Utility Maximization via GPU-Accelerated Proximal Message Passing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NI","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Akshay Sreekumar, Anthony Degleris, Ram Rajagopal","submitted_at":"2025-09-12T22:23:56Z","abstract_excerpt":"We present a GPU-accelerated proximal message passing algorithm for large-scale network utility maximization (NUM). NUM is a fundamental problem in resource allocation, where resources are allocated across various streams in a network to maximize total utility while respecting link capacity constraints. Our method, a variant of ADMM, requires only sparse matrix-vector multiplies with the link-route matrix and element-wise proximal operator evaluations, enabling fully parallel updates across streams and links. It also supports heterogeneous utility types, including logarithmic utilities common "},"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":"2509.10722","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-12T22:23:56Z","cross_cats_sorted":["cs.NI","cs.SY","eess.SY"],"title_canon_sha256":"33c50750430f4917c4d07668ec1af64376263e538e21622a0745542ac2658d1d","abstract_canon_sha256":"dc16bd1718cbcecb7d16df7890488834322ced5f3772cdc0f6f3833a46b3d24a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:11:26.767811Z","signature_b64":"UW7SevrhkNjOU8vACIEZJUFur7antKeglDeBemF/cAmKxrJBw6ztfr1n+LnDiwK96e0veCiznOY+iqU2knpnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9b6a77e8129a03741edfc39dc3e978d5bfccfe7211f2669238b42d0df2dec01","last_reissued_at":"2026-07-05T12:11:26.767236Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:11:26.767236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large-Scale Network Utility Maximization via GPU-Accelerated Proximal Message Passing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NI","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Akshay Sreekumar, Anthony Degleris, Ram Rajagopal","submitted_at":"2025-09-12T22:23:56Z","abstract_excerpt":"We present a GPU-accelerated proximal message passing algorithm for large-scale network utility maximization (NUM). NUM is a fundamental problem in resource allocation, where resources are allocated across various streams in a network to maximize total utility while respecting link capacity constraints. Our method, a variant of ADMM, requires only sparse matrix-vector multiplies with the link-route matrix and element-wise proximal operator evaluations, enabling fully parallel updates across streams and links. It also supports heterogeneous utility types, including logarithmic utilities common "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.10722","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.10722/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2509.10722","created_at":"2026-07-05T12:11:26.767310+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.10722v1","created_at":"2026-07-05T12:11:26.767310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.10722","created_at":"2026-07-05T12:11:26.767310+00:00"},{"alias_kind":"pith_short_12","alias_value":"VG3KO7UBFGQD","created_at":"2026-07-05T12:11:26.767310+00:00"},{"alias_kind":"pith_short_16","alias_value":"VG3KO7UBFGQDOQPN","created_at":"2026-07-05T12:11:26.767310+00:00"},{"alias_kind":"pith_short_8","alias_value":"VG3KO7UB","created_at":"2026-07-05T12:11:26.767310+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/VG3KO7UBFGQDOQPN7Q45YPUXRV","json":"https://pith.science/pith/VG3KO7UBFGQDOQPN7Q45YPUXRV.json","graph_json":"https://pith.science/api/pith-number/VG3KO7UBFGQDOQPN7Q45YPUXRV/graph.json","events_json":"https://pith.science/api/pith-number/VG3KO7UBFGQDOQPN7Q45YPUXRV/events.json","paper":"https://pith.science/paper/VG3KO7UB"},"agent_actions":{"view_html":"https://pith.science/pith/VG3KO7UBFGQDOQPN7Q45YPUXRV","download_json":"https://pith.science/pith/VG3KO7UBFGQDOQPN7Q45YPUXRV.json","view_paper":"https://pith.science/paper/VG3KO7UB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.10722&json=true","fetch_graph":"https://pith.science/api/pith-number/VG3KO7UBFGQDOQPN7Q45YPUXRV/graph.json","fetch_events":"https://pith.science/api/pith-number/VG3KO7UBFGQDOQPN7Q45YPUXRV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VG3KO7UBFGQDOQPN7Q45YPUXRV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VG3KO7UBFGQDOQPN7Q45YPUXRV/action/storage_attestation","attest_author":"https://pith.science/pith/VG3KO7UBFGQDOQPN7Q45YPUXRV/action/author_attestation","sign_citation":"https://pith.science/pith/VG3KO7UBFGQDOQPN7Q45YPUXRV/action/citation_signature","submit_replication":"https://pith.science/pith/VG3KO7UBFGQDOQPN7Q45YPUXRV/action/replication_record"}},"created_at":"2026-07-05T12:11:26.767310+00:00","updated_at":"2026-07-05T12:11:26.767310+00:00"}