{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UPEWDFAIZ5IDV547HTUT33NQZW","short_pith_number":"pith:UPEWDFAI","canonical_record":{"source":{"id":"1703.04113","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-12T13:06:58Z","cross_cats_sorted":[],"title_canon_sha256":"55a45577a62eef0fae798797651b4035dacdf6d409a7112807c3db5b36d34679","abstract_canon_sha256":"371e1cf504952edf8be57242977161c4ff96e66327b91e7e01f5b18836af7474"},"schema_version":"1.0"},"canonical_sha256":"a3c9619408cf503af79f3ce93dedb0cda08bf276a58ffee8753c9184f3f3d57b","source":{"kind":"arxiv","id":"1703.04113","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04113","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04113v5","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04113","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"UPEWDFAIZ5ID","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UPEWDFAIZ5IDV547","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UPEWDFAI","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UPEWDFAIZ5IDV547HTUT33NQZW","target":"record","payload":{"canonical_record":{"source":{"id":"1703.04113","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-12T13:06:58Z","cross_cats_sorted":[],"title_canon_sha256":"55a45577a62eef0fae798797651b4035dacdf6d409a7112807c3db5b36d34679","abstract_canon_sha256":"371e1cf504952edf8be57242977161c4ff96e66327b91e7e01f5b18836af7474"},"schema_version":"1.0"},"canonical_sha256":"a3c9619408cf503af79f3ce93dedb0cda08bf276a58ffee8753c9184f3f3d57b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:25.142138Z","signature_b64":"67HD6JyBdVLUJmvUn3EsLJFjpb0FYFRbKOnUx5gf2YtrFSZW3Zt5B93ILb0TmWYYxDCLXz40xO8qwpLFMPZTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3c9619408cf503af79f3ce93dedb0cda08bf276a58ffee8753c9184f3f3d57b","last_reissued_at":"2026-05-18T00:03:25.141619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:25.141619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.04113","source_version":5,"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-18T00:03:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OvLgK9d81GwnjVfPn91XbheSR5CuPA/tl2B9xHkfeKVPsZjbi2yfaF9N1N0clqAmZHXFtI/cJqBPPWnQEOPcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T05:00:44.930171Z"},"content_sha256":"11dfaeb2ae97ba4ed32102b3cd08bbe0e4d0f507b430a0dc81065bcea7bf7cc8","schema_version":"1.0","event_id":"sha256:11dfaeb2ae97ba4ed32102b3cd08bbe0e4d0f507b430a0dc81065bcea7bf7cc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UPEWDFAIZ5IDV547HTUT33NQZW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Generalized Nash Equilibria in a Class of Convex Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Maryam Kamgarpour, Tatiana Tatarenko","submitted_at":"2017-03-12T13:06:58Z","abstract_excerpt":"We consider multi-agent decision making where each agent optimizes its convex cost function subject to individual and coupling constraints. The constraint sets are compact convex subsets of a Euclidean space. To learn Nash equilibria, we propose a novel distributed payoff-based algorithm, such that each agent uses information only about its cost function values and the constraint function values with their associated dual multiplier. We prove convergence of this algorithm to a Nash equilibrium, under the assumption that the game admits a strictly convex potential function. In the absence of co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04113","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":""},"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-18T00:03:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vZLZymy0paPj7G4Mim61VKAQJSyEVqp+Zj8hvXJIMMQEnNCQ2QBJcWaO9KY273PbKK2EFV6KSxbWh4EF4NzQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T05:00:44.930537Z"},"content_sha256":"afbf58a4c60b6280bb5cd8c92916605963dbc991e60043ed0221c0d69e678d84","schema_version":"1.0","event_id":"sha256:afbf58a4c60b6280bb5cd8c92916605963dbc991e60043ed0221c0d69e678d84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UPEWDFAIZ5IDV547HTUT33NQZW/bundle.json","state_url":"https://pith.science/pith/UPEWDFAIZ5IDV547HTUT33NQZW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UPEWDFAIZ5IDV547HTUT33NQZW/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-21T05:00:44Z","links":{"resolver":"https://pith.science/pith/UPEWDFAIZ5IDV547HTUT33NQZW","bundle":"https://pith.science/pith/UPEWDFAIZ5IDV547HTUT33NQZW/bundle.json","state":"https://pith.science/pith/UPEWDFAIZ5IDV547HTUT33NQZW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UPEWDFAIZ5IDV547HTUT33NQZW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UPEWDFAIZ5IDV547HTUT33NQZW","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":"371e1cf504952edf8be57242977161c4ff96e66327b91e7e01f5b18836af7474","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-12T13:06:58Z","title_canon_sha256":"55a45577a62eef0fae798797651b4035dacdf6d409a7112807c3db5b36d34679"},"schema_version":"1.0","source":{"id":"1703.04113","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04113","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04113v5","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04113","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"UPEWDFAIZ5ID","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UPEWDFAIZ5IDV547","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UPEWDFAI","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:afbf58a4c60b6280bb5cd8c92916605963dbc991e60043ed0221c0d69e678d84","target":"graph","created_at":"2026-05-18T00:03:25Z","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":"We consider multi-agent decision making where each agent optimizes its convex cost function subject to individual and coupling constraints. The constraint sets are compact convex subsets of a Euclidean space. To learn Nash equilibria, we propose a novel distributed payoff-based algorithm, such that each agent uses information only about its cost function values and the constraint function values with their associated dual multiplier. We prove convergence of this algorithm to a Nash equilibrium, under the assumption that the game admits a strictly convex potential function. In the absence of co","authors_text":"Maryam Kamgarpour, Tatiana Tatarenko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-12T13:06:58Z","title":"Learning Generalized Nash Equilibria in a Class of Convex Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04113","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:11dfaeb2ae97ba4ed32102b3cd08bbe0e4d0f507b430a0dc81065bcea7bf7cc8","target":"record","created_at":"2026-05-18T00:03:25Z","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":"371e1cf504952edf8be57242977161c4ff96e66327b91e7e01f5b18836af7474","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-12T13:06:58Z","title_canon_sha256":"55a45577a62eef0fae798797651b4035dacdf6d409a7112807c3db5b36d34679"},"schema_version":"1.0","source":{"id":"1703.04113","kind":"arxiv","version":5}},"canonical_sha256":"a3c9619408cf503af79f3ce93dedb0cda08bf276a58ffee8753c9184f3f3d57b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3c9619408cf503af79f3ce93dedb0cda08bf276a58ffee8753c9184f3f3d57b","first_computed_at":"2026-05-18T00:03:25.141619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:25.141619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"67HD6JyBdVLUJmvUn3EsLJFjpb0FYFRbKOnUx5gf2YtrFSZW3Zt5B93ILb0TmWYYxDCLXz40xO8qwpLFMPZTBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:25.142138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.04113","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11dfaeb2ae97ba4ed32102b3cd08bbe0e4d0f507b430a0dc81065bcea7bf7cc8","sha256:afbf58a4c60b6280bb5cd8c92916605963dbc991e60043ed0221c0d69e678d84"],"state_sha256":"dbcec12fa0e015c0c77d6949fa2600a7650646ffb96435b555c533becfbabdf7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZbWWHrV0bKglhapPaZTC8iU5UKe53CJXiTKmR3djvT6YVVXBlL1QDCSzTh3QDQV65iNAaBQ+awSKrZgSdQR7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T05:00:44.932568Z","bundle_sha256":"2bc962c44545ea7ed2b2b58918c3822eacd43966dafebd2146ba7d0ffbe2ba36"}}