{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PQ3NVB4C2U4Z3Z43GCKCB3JDGL","short_pith_number":"pith:PQ3NVB4C","schema_version":"1.0","canonical_sha256":"7c36da8782d5399de79b309420ed2332dbeaf3c5cb808f7f11a91d00daf5f28d","source":{"kind":"arxiv","id":"1909.13321","version":5},"attestation_state":"computed","paper":{"title":"Numerical methods for the resource allocation problem in networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Anastasiya Ivanova, Dmitry Pasechnyuk, Evgeniya Vorontsova, Pavel Dvurechensky","submitted_at":"2019-09-29T17:00:37Z","abstract_excerpt":"In this paper, we consider the resource allocation problem in a network with a large number of connections which are used by a huge number of users. The resource allocation problem under discussion is a maximization problem with linear inequality constraints. To solve this problem we construct the dual problem and propose to use the following numerical optimization methods for the dual: a fast gradient method, a stochastic projected subgradient method, an ellipsoid method, and a random gradient extrapolation method. A special focus is made on the primal-dual analysis of these methods. For each"},"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":"1909.13321","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-29T17:00:37Z","cross_cats_sorted":[],"title_canon_sha256":"71c45b652d9b05e67e9e43c02387cb0eecf66fe47206a73cb7b869050869b66f","abstract_canon_sha256":"b0950ece0ebac1715089519ad95a82753248751bc4e5d1f0cdc7e09bef3cfec4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:13:11.435754Z","signature_b64":"AjtL9yxH5II8qU2wb1k3xzSL8C4VTgy1sMoZ0D7F7jeNUks1fXv2qizyvGmslYzWPf/Sd6kddl8Xk+9HxJ6nAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c36da8782d5399de79b309420ed2332dbeaf3c5cb808f7f11a91d00daf5f28d","last_reissued_at":"2026-07-05T02:13:11.435324Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:13:11.435324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical methods for the resource allocation problem in networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Anastasiya Ivanova, Dmitry Pasechnyuk, Evgeniya Vorontsova, Pavel Dvurechensky","submitted_at":"2019-09-29T17:00:37Z","abstract_excerpt":"In this paper, we consider the resource allocation problem in a network with a large number of connections which are used by a huge number of users. The resource allocation problem under discussion is a maximization problem with linear inequality constraints. To solve this problem we construct the dual problem and propose to use the following numerical optimization methods for the dual: a fast gradient method, a stochastic projected subgradient method, an ellipsoid method, and a random gradient extrapolation method. A special focus is made on the primal-dual analysis of these methods. For each"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.13321","kind":"arxiv","version":5},"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/1909.13321/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":"1909.13321","created_at":"2026-07-05T02:13:11.435379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.13321v5","created_at":"2026-07-05T02:13:11.435379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.13321","created_at":"2026-07-05T02:13:11.435379+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQ3NVB4C2U4Z","created_at":"2026-07-05T02:13:11.435379+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQ3NVB4C2U4Z3Z43","created_at":"2026-07-05T02:13:11.435379+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQ3NVB4C","created_at":"2026-07-05T02:13:11.435379+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/PQ3NVB4C2U4Z3Z43GCKCB3JDGL","json":"https://pith.science/pith/PQ3NVB4C2U4Z3Z43GCKCB3JDGL.json","graph_json":"https://pith.science/api/pith-number/PQ3NVB4C2U4Z3Z43GCKCB3JDGL/graph.json","events_json":"https://pith.science/api/pith-number/PQ3NVB4C2U4Z3Z43GCKCB3JDGL/events.json","paper":"https://pith.science/paper/PQ3NVB4C"},"agent_actions":{"view_html":"https://pith.science/pith/PQ3NVB4C2U4Z3Z43GCKCB3JDGL","download_json":"https://pith.science/pith/PQ3NVB4C2U4Z3Z43GCKCB3JDGL.json","view_paper":"https://pith.science/paper/PQ3NVB4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.13321&json=true","fetch_graph":"https://pith.science/api/pith-number/PQ3NVB4C2U4Z3Z43GCKCB3JDGL/graph.json","fetch_events":"https://pith.science/api/pith-number/PQ3NVB4C2U4Z3Z43GCKCB3JDGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQ3NVB4C2U4Z3Z43GCKCB3JDGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQ3NVB4C2U4Z3Z43GCKCB3JDGL/action/storage_attestation","attest_author":"https://pith.science/pith/PQ3NVB4C2U4Z3Z43GCKCB3JDGL/action/author_attestation","sign_citation":"https://pith.science/pith/PQ3NVB4C2U4Z3Z43GCKCB3JDGL/action/citation_signature","submit_replication":"https://pith.science/pith/PQ3NVB4C2U4Z3Z43GCKCB3JDGL/action/replication_record"}},"created_at":"2026-07-05T02:13:11.435379+00:00","updated_at":"2026-07-05T02:13:11.435379+00:00"}