{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PQ3NVB4C2U4Z3Z43GCKCB3JDGL","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":"b0950ece0ebac1715089519ad95a82753248751bc4e5d1f0cdc7e09bef3cfec4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-29T17:00:37Z","title_canon_sha256":"71c45b652d9b05e67e9e43c02387cb0eecf66fe47206a73cb7b869050869b66f"},"schema_version":"1.0","source":{"id":"1909.13321","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.13321","created_at":"2026-07-05T02:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"1909.13321v5","created_at":"2026-07-05T02:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.13321","created_at":"2026-07-05T02:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"PQ3NVB4C2U4Z","created_at":"2026-07-05T02:13:11Z"},{"alias_kind":"pith_short_16","alias_value":"PQ3NVB4C2U4Z3Z43","created_at":"2026-07-05T02:13:11Z"},{"alias_kind":"pith_short_8","alias_value":"PQ3NVB4C","created_at":"2026-07-05T02:13:11Z"}],"graph_snapshots":[{"event_id":"sha256:b8f06edbd9b35210c1f8ab25794dd72cfe624a887fdd1f8f22dbfa13d831edd1","target":"graph","created_at":"2026-07-05T02:13:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.13321/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alexander Gasnikov, Anastasiya Ivanova, Dmitry Pasechnyuk, Evgeniya Vorontsova, Pavel Dvurechensky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-29T17:00:37Z","title":"Numerical methods for the resource allocation problem in networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.13321","kind":"arxiv","version":5},"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:e8f4843529f44e078df273717e75e9c1b8768c2c87c380330f016a5371efaec2","target":"record","created_at":"2026-07-05T02:13:11Z","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":"b0950ece0ebac1715089519ad95a82753248751bc4e5d1f0cdc7e09bef3cfec4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-29T17:00:37Z","title_canon_sha256":"71c45b652d9b05e67e9e43c02387cb0eecf66fe47206a73cb7b869050869b66f"},"schema_version":"1.0","source":{"id":"1909.13321","kind":"arxiv","version":5}},"canonical_sha256":"7c36da8782d5399de79b309420ed2332dbeaf3c5cb808f7f11a91d00daf5f28d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c36da8782d5399de79b309420ed2332dbeaf3c5cb808f7f11a91d00daf5f28d","first_computed_at":"2026-07-05T02:13:11.435324Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:13:11.435324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AjtL9yxH5II8qU2wb1k3xzSL8C4VTgy1sMoZ0D7F7jeNUks1fXv2qizyvGmslYzWPf/Sd6kddl8Xk+9HxJ6nAA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:13:11.435754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.13321","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8f4843529f44e078df273717e75e9c1b8768c2c87c380330f016a5371efaec2","sha256:b8f06edbd9b35210c1f8ab25794dd72cfe624a887fdd1f8f22dbfa13d831edd1"],"state_sha256":"c8f2e8ca69de40b7e449c0ae17f21df94bed40397bbaf35c07115fd26cfa9033"}