{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OBAIG62INJ3L6T2SPAG5WPVTEK","short_pith_number":"pith:OBAIG62I","canonical_record":{"source":{"id":"1911.07354","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-17T22:19:01Z","cross_cats_sorted":[],"title_canon_sha256":"2010b062624bf88e5b66a767bd9bef3409d8b77d62b4c53f8026ac64ed5be1e2","abstract_canon_sha256":"c80728d577fa1dd0093b16aa66338e1586dcec27350af3ed7068ce8ab9f284d0"},"schema_version":"1.0"},"canonical_sha256":"7040837b486a76bf4f52780ddb3eb322894e124c56e74ae34140504bd7aa9ed6","source":{"kind":"arxiv","id":"1911.07354","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.07354","created_at":"2026-07-05T00:25:29Z"},{"alias_kind":"arxiv_version","alias_value":"1911.07354v2","created_at":"2026-07-05T00:25:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.07354","created_at":"2026-07-05T00:25:29Z"},{"alias_kind":"pith_short_12","alias_value":"OBAIG62INJ3L","created_at":"2026-07-05T00:25:29Z"},{"alias_kind":"pith_short_16","alias_value":"OBAIG62INJ3L6T2S","created_at":"2026-07-05T00:25:29Z"},{"alias_kind":"pith_short_8","alias_value":"OBAIG62I","created_at":"2026-07-05T00:25:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OBAIG62INJ3L6T2SPAG5WPVTEK","target":"record","payload":{"canonical_record":{"source":{"id":"1911.07354","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-17T22:19:01Z","cross_cats_sorted":[],"title_canon_sha256":"2010b062624bf88e5b66a767bd9bef3409d8b77d62b4c53f8026ac64ed5be1e2","abstract_canon_sha256":"c80728d577fa1dd0093b16aa66338e1586dcec27350af3ed7068ce8ab9f284d0"},"schema_version":"1.0"},"canonical_sha256":"7040837b486a76bf4f52780ddb3eb322894e124c56e74ae34140504bd7aa9ed6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:25:29.222913Z","signature_b64":"uS0+G2LKC543tNCOn33HjBiVbX6ZMpQutxSd4NyOanCr1dUhcWB9x0tn/LaqsXKXcGAp1QfYu3T7WNnJBxCOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7040837b486a76bf4f52780ddb3eb322894e124c56e74ae34140504bd7aa9ed6","last_reissued_at":"2026-07-05T00:25:29.222398Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:25:29.222398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.07354","source_version":2,"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-07-05T00:25:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3kQ4TZfVPm+LXkQD/6DyW7+W16eDA0zqkHjDEdzhcCsnAtywxAdMdJWc75JK9iX9Te4mrI8AyX6VylsnGjtsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:52:08.172264Z"},"content_sha256":"fc5926cbd4e8b9e3c3161691ffbd3600c1a8d48a88a3861d060a14760afa78f2","schema_version":"1.0","event_id":"sha256:fc5926cbd4e8b9e3c3161691ffbd3600c1a8d48a88a3861d060a14760afa78f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OBAIG62INJ3L6T2SPAG5WPVTEK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Mirror Descent for the Network Utility Maximization Problem","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, Fedor Stonyakin","submitted_at":"2019-11-17T22:19:01Z","abstract_excerpt":"Network utility maximization is the most important problem in network traffic management. Given the growth of modern communication networks, we consider the utility maximization problem in a network with a large number of connections (links) that are used by a huge number of users. To solve this problem an adaptive mirror descent algorithm for many constraints is proposed. The key feature of the algorithm is that it has a dimension-free convergence rate. The convergence of the proposed scheme is proved theoretically. The theoretical analysis is verified with numerical simulations. We compare t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.07354","kind":"arxiv","version":2},"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/1911.07354/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"},"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-07-05T00:25:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5cLhIRw+jaMUG+qbQ5mxdA00AccAe+wgfTjnS90/e+E1ydkBbZVPkdaubAAI6EG1vnjW7Xi5Gd/wu252iVJCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:52:08.172763Z"},"content_sha256":"9738faa85551f6eadbd2daceb21d5cfa76b6a496383ea436ce3b4b8eb54416ee","schema_version":"1.0","event_id":"sha256:9738faa85551f6eadbd2daceb21d5cfa76b6a496383ea436ce3b4b8eb54416ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OBAIG62INJ3L6T2SPAG5WPVTEK/bundle.json","state_url":"https://pith.science/pith/OBAIG62INJ3L6T2SPAG5WPVTEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OBAIG62INJ3L6T2SPAG5WPVTEK/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-08-03T19:52:08Z","links":{"resolver":"https://pith.science/pith/OBAIG62INJ3L6T2SPAG5WPVTEK","bundle":"https://pith.science/pith/OBAIG62INJ3L6T2SPAG5WPVTEK/bundle.json","state":"https://pith.science/pith/OBAIG62INJ3L6T2SPAG5WPVTEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OBAIG62INJ3L6T2SPAG5WPVTEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OBAIG62INJ3L6T2SPAG5WPVTEK","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":"c80728d577fa1dd0093b16aa66338e1586dcec27350af3ed7068ce8ab9f284d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-17T22:19:01Z","title_canon_sha256":"2010b062624bf88e5b66a767bd9bef3409d8b77d62b4c53f8026ac64ed5be1e2"},"schema_version":"1.0","source":{"id":"1911.07354","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.07354","created_at":"2026-07-05T00:25:29Z"},{"alias_kind":"arxiv_version","alias_value":"1911.07354v2","created_at":"2026-07-05T00:25:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.07354","created_at":"2026-07-05T00:25:29Z"},{"alias_kind":"pith_short_12","alias_value":"OBAIG62INJ3L","created_at":"2026-07-05T00:25:29Z"},{"alias_kind":"pith_short_16","alias_value":"OBAIG62INJ3L6T2S","created_at":"2026-07-05T00:25:29Z"},{"alias_kind":"pith_short_8","alias_value":"OBAIG62I","created_at":"2026-07-05T00:25:29Z"}],"graph_snapshots":[{"event_id":"sha256:9738faa85551f6eadbd2daceb21d5cfa76b6a496383ea436ce3b4b8eb54416ee","target":"graph","created_at":"2026-07-05T00:25:29Z","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/1911.07354/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Network utility maximization is the most important problem in network traffic management. Given the growth of modern communication networks, we consider the utility maximization problem in a network with a large number of connections (links) that are used by a huge number of users. To solve this problem an adaptive mirror descent algorithm for many constraints is proposed. The key feature of the algorithm is that it has a dimension-free convergence rate. The convergence of the proposed scheme is proved theoretically. The theoretical analysis is verified with numerical simulations. We compare t","authors_text":"Alexander Gasnikov, Anastasiya Ivanova, Dmitry Pasechnyuk, Evgeniya Vorontsova, Fedor Stonyakin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-17T22:19:01Z","title":"Adaptive Mirror Descent for the Network Utility Maximization Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.07354","kind":"arxiv","version":2},"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:fc5926cbd4e8b9e3c3161691ffbd3600c1a8d48a88a3861d060a14760afa78f2","target":"record","created_at":"2026-07-05T00:25:29Z","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":"c80728d577fa1dd0093b16aa66338e1586dcec27350af3ed7068ce8ab9f284d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-17T22:19:01Z","title_canon_sha256":"2010b062624bf88e5b66a767bd9bef3409d8b77d62b4c53f8026ac64ed5be1e2"},"schema_version":"1.0","source":{"id":"1911.07354","kind":"arxiv","version":2}},"canonical_sha256":"7040837b486a76bf4f52780ddb3eb322894e124c56e74ae34140504bd7aa9ed6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7040837b486a76bf4f52780ddb3eb322894e124c56e74ae34140504bd7aa9ed6","first_computed_at":"2026-07-05T00:25:29.222398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:25:29.222398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uS0+G2LKC543tNCOn33HjBiVbX6ZMpQutxSd4NyOanCr1dUhcWB9x0tn/LaqsXKXcGAp1QfYu3T7WNnJBxCOAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:25:29.222913Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.07354","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc5926cbd4e8b9e3c3161691ffbd3600c1a8d48a88a3861d060a14760afa78f2","sha256:9738faa85551f6eadbd2daceb21d5cfa76b6a496383ea436ce3b4b8eb54416ee"],"state_sha256":"01dcf7d7ccfade17cf2844c9d122a29aa83b243b71354d4fe5d611724a15ca5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rBjBt+UWH+bysC3wpGFsjO8pRA6lGWDHHkT6QGRVFDVyXwynjCQ47azXmC6CMDELOmnSwR0ueL+/F1OEuHswCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:52:08.177696Z","bundle_sha256":"9e8d00033b599e811541a7afa1eed7bae442297879f674646932159ebb5cf50e"}}