{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:O2UPFVMG6APA6YTHKHLGT67IGX","short_pith_number":"pith:O2UPFVMG","canonical_record":{"source":{"id":"1606.08988","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-29T07:49:09Z","cross_cats_sorted":[],"title_canon_sha256":"055e3b591c77c8fd9032368ec9921c8576e25c21f9a9d43c13ad2f230d8f6b7e","abstract_canon_sha256":"5d8c635f03abe34db687156aaf0f06b88d3c89ff194590007000c50a0c2596e1"},"schema_version":"1.0"},"canonical_sha256":"76a8f2d586f01e0f626751d669fbe835f10c154cb634fc2b6eecfa7a9cf88791","source":{"kind":"arxiv","id":"1606.08988","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08988","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08988v2","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08988","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"O2UPFVMG6APA","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O2UPFVMG6APA6YTH","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O2UPFVMG","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:O2UPFVMG6APA6YTHKHLGT67IGX","target":"record","payload":{"canonical_record":{"source":{"id":"1606.08988","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-29T07:49:09Z","cross_cats_sorted":[],"title_canon_sha256":"055e3b591c77c8fd9032368ec9921c8576e25c21f9a9d43c13ad2f230d8f6b7e","abstract_canon_sha256":"5d8c635f03abe34db687156aaf0f06b88d3c89ff194590007000c50a0c2596e1"},"schema_version":"1.0"},"canonical_sha256":"76a8f2d586f01e0f626751d669fbe835f10c154cb634fc2b6eecfa7a9cf88791","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:56.544322Z","signature_b64":"1XrR4DDF8fxSv9oRVtpdc22oxpzfbsOp8mEmc7oehlRa9GwHyvaSOhhQ267/vDLp9TOzAphFHNUTwaH1HC8UCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76a8f2d586f01e0f626751d669fbe835f10c154cb634fc2b6eecfa7a9cf88791","last_reissued_at":"2026-05-18T01:07:56.543788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:56.543788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.08988","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-05-18T01:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FtDadq69Cai/Q2o3Pfmq2MTpHMHdn9DZmhBo0MaIN9Yw4fGNd/+MR/1sOSs+OnbtXqU7cc5l3iIqyndbxjdJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:15:09.601212Z"},"content_sha256":"1c2b166e52b162f3ce67098d7a037274787c1c13ebec024db1a55cb9d106955f","schema_version":"1.0","event_id":"sha256:1c2b166e52b162f3ce67098d7a037274787c1c13ebec024db1a55cb9d106955f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:O2UPFVMG6APA6YTHKHLGT67IGX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Primal-Dual Method for Searching Equilibrium in Hierarchical Congestion Population Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Anton Rodomanov, Evgenia Gasnikova, Inna Usik, Pavel Dvurechensky, Sergey Matsievsky","submitted_at":"2016-06-29T07:49:09Z","abstract_excerpt":"In this paper, we consider a large class of hierarchical congestion population games. One can show that the equilibrium in a game of such type can be described as a minimum point in a properly constructed multi-level convex optimization problem. We propose a fast primal-dual composite gradient method and apply it to the problem, which is dual to the problem describing the equilibrium in the considered class of games. We prove that this method allows to find an approximate solution of the initial problem without increasing the complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08988","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":""},"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-18T01:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aa6S54S2WdZnAB3fv0H7MBiesqhWFwxWF/JRgVGY5thiNxJHntamVvkJvKVeAeg4yxZO51dU5XFrsHcAY7l+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:15:09.601624Z"},"content_sha256":"ec810d133cef4d62e60ee28dbc6df20927fc097b406dacbe5e13b51e003c0b8e","schema_version":"1.0","event_id":"sha256:ec810d133cef4d62e60ee28dbc6df20927fc097b406dacbe5e13b51e003c0b8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2UPFVMG6APA6YTHKHLGT67IGX/bundle.json","state_url":"https://pith.science/pith/O2UPFVMG6APA6YTHKHLGT67IGX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2UPFVMG6APA6YTHKHLGT67IGX/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-27T17:15:09Z","links":{"resolver":"https://pith.science/pith/O2UPFVMG6APA6YTHKHLGT67IGX","bundle":"https://pith.science/pith/O2UPFVMG6APA6YTHKHLGT67IGX/bundle.json","state":"https://pith.science/pith/O2UPFVMG6APA6YTHKHLGT67IGX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2UPFVMG6APA6YTHKHLGT67IGX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:O2UPFVMG6APA6YTHKHLGT67IGX","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":"5d8c635f03abe34db687156aaf0f06b88d3c89ff194590007000c50a0c2596e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-29T07:49:09Z","title_canon_sha256":"055e3b591c77c8fd9032368ec9921c8576e25c21f9a9d43c13ad2f230d8f6b7e"},"schema_version":"1.0","source":{"id":"1606.08988","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08988","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08988v2","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08988","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"O2UPFVMG6APA","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O2UPFVMG6APA6YTH","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O2UPFVMG","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:ec810d133cef4d62e60ee28dbc6df20927fc097b406dacbe5e13b51e003c0b8e","target":"graph","created_at":"2026-05-18T01:07:56Z","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":"In this paper, we consider a large class of hierarchical congestion population games. One can show that the equilibrium in a game of such type can be described as a minimum point in a properly constructed multi-level convex optimization problem. We propose a fast primal-dual composite gradient method and apply it to the problem, which is dual to the problem describing the equilibrium in the considered class of games. We prove that this method allows to find an approximate solution of the initial problem without increasing the complexity.","authors_text":"Alexander Gasnikov, Anton Rodomanov, Evgenia Gasnikova, Inna Usik, Pavel Dvurechensky, Sergey Matsievsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-29T07:49:09Z","title":"Primal-Dual Method for Searching Equilibrium in Hierarchical Congestion Population Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08988","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:1c2b166e52b162f3ce67098d7a037274787c1c13ebec024db1a55cb9d106955f","target":"record","created_at":"2026-05-18T01:07:56Z","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":"5d8c635f03abe34db687156aaf0f06b88d3c89ff194590007000c50a0c2596e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-29T07:49:09Z","title_canon_sha256":"055e3b591c77c8fd9032368ec9921c8576e25c21f9a9d43c13ad2f230d8f6b7e"},"schema_version":"1.0","source":{"id":"1606.08988","kind":"arxiv","version":2}},"canonical_sha256":"76a8f2d586f01e0f626751d669fbe835f10c154cb634fc2b6eecfa7a9cf88791","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76a8f2d586f01e0f626751d669fbe835f10c154cb634fc2b6eecfa7a9cf88791","first_computed_at":"2026-05-18T01:07:56.543788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:56.543788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1XrR4DDF8fxSv9oRVtpdc22oxpzfbsOp8mEmc7oehlRa9GwHyvaSOhhQ267/vDLp9TOzAphFHNUTwaH1HC8UCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:56.544322Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.08988","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c2b166e52b162f3ce67098d7a037274787c1c13ebec024db1a55cb9d106955f","sha256:ec810d133cef4d62e60ee28dbc6df20927fc097b406dacbe5e13b51e003c0b8e"],"state_sha256":"f4dca12708f9963c1c237c9bf3e0c737ffbf87a6f9ecf0fb64f8ab5af2fe64ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yq4RgHzjFiBZeul/+a7z2Z9C2LC1aOmEOc74sbTDdmaZk1J1VCI4gt7H1F8wsxgto99eq8cfMPl1gwMQ7FTyCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:15:09.604829Z","bundle_sha256":"e3e7b9ee16ab315aefb000a8c42c42d29b80b12cd76e6431da4435e3f5d11f60"}}