{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QERF62RBSXWCOT4XNDQVDNFTGM","short_pith_number":"pith:QERF62RB","schema_version":"1.0","canonical_sha256":"81225f6a2195ec274f9768e151b4b33302458a199184bd43977e64c1df98ec7e","source":{"kind":"arxiv","id":"1703.08509","version":1},"attestation_state":"computed","paper":{"title":"Generalized Nash Equilibrium Problem by the Alternating Direction Method of Multipliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.GT","authors_text":"Farzad Salehisadaghiani, Lacra Pavel","submitted_at":"2017-03-24T17:05:58Z","abstract_excerpt":"In this paper, the problem of finding a generalized Nash equilibrium (GNE) of a networked game is studied. Players are only able to choose their decisions from a feasible action set. The feasible set is considered to be a private linear equality constraint that is coupled through decisions of the other players. We consider that each player has his own private constraint and it has not to be shared with the other players. This general case also embodies the one with shared constraints between players and it can be also simply extended to the case with inequality constraints. Since the players d"},"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":"1703.08509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-24T17:05:58Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"2515c6bdf118bf87c04ac9c658232bfae2bcbbf9dcb721f75b612e470f417990","abstract_canon_sha256":"567cba569a0d086479e7e8bcda835e6383444a497820b84a42e6d7b9845e8340"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:59.776362Z","signature_b64":"hFwBS3wtkk/ehElIoxXs+eLo1guQcwdvm9XLDhqQyqjyV0BiPtxEgVEN4orf3nMaykeOLA9cG7iKeHQnShPyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81225f6a2195ec274f9768e151b4b33302458a199184bd43977e64c1df98ec7e","last_reissued_at":"2026-05-18T00:47:59.775886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:59.775886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Nash Equilibrium Problem by the Alternating Direction Method of Multipliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.GT","authors_text":"Farzad Salehisadaghiani, Lacra Pavel","submitted_at":"2017-03-24T17:05:58Z","abstract_excerpt":"In this paper, the problem of finding a generalized Nash equilibrium (GNE) of a networked game is studied. Players are only able to choose their decisions from a feasible action set. The feasible set is considered to be a private linear equality constraint that is coupled through decisions of the other players. We consider that each player has his own private constraint and it has not to be shared with the other players. This general case also embodies the one with shared constraints between players and it can be also simply extended to the case with inequality constraints. Since the players d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08509","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.08509","created_at":"2026-05-18T00:47:59.775954+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.08509v1","created_at":"2026-05-18T00:47:59.775954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08509","created_at":"2026-05-18T00:47:59.775954+00:00"},{"alias_kind":"pith_short_12","alias_value":"QERF62RBSXWC","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QERF62RBSXWCOT4X","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QERF62RB","created_at":"2026-05-18T12:31:37.085036+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/QERF62RBSXWCOT4XNDQVDNFTGM","json":"https://pith.science/pith/QERF62RBSXWCOT4XNDQVDNFTGM.json","graph_json":"https://pith.science/api/pith-number/QERF62RBSXWCOT4XNDQVDNFTGM/graph.json","events_json":"https://pith.science/api/pith-number/QERF62RBSXWCOT4XNDQVDNFTGM/events.json","paper":"https://pith.science/paper/QERF62RB"},"agent_actions":{"view_html":"https://pith.science/pith/QERF62RBSXWCOT4XNDQVDNFTGM","download_json":"https://pith.science/pith/QERF62RBSXWCOT4XNDQVDNFTGM.json","view_paper":"https://pith.science/paper/QERF62RB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.08509&json=true","fetch_graph":"https://pith.science/api/pith-number/QERF62RBSXWCOT4XNDQVDNFTGM/graph.json","fetch_events":"https://pith.science/api/pith-number/QERF62RBSXWCOT4XNDQVDNFTGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QERF62RBSXWCOT4XNDQVDNFTGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QERF62RBSXWCOT4XNDQVDNFTGM/action/storage_attestation","attest_author":"https://pith.science/pith/QERF62RBSXWCOT4XNDQVDNFTGM/action/author_attestation","sign_citation":"https://pith.science/pith/QERF62RBSXWCOT4XNDQVDNFTGM/action/citation_signature","submit_replication":"https://pith.science/pith/QERF62RBSXWCOT4XNDQVDNFTGM/action/replication_record"}},"created_at":"2026-05-18T00:47:59.775954+00:00","updated_at":"2026-05-18T00:47:59.775954+00:00"}