{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WQVRR432EBDVAGCKV6NTUH2WLF","short_pith_number":"pith:WQVRR432","canonical_record":{"source":{"id":"1801.02967","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-09T14:54:40Z","cross_cats_sorted":[],"title_canon_sha256":"52bf21e0132a1b401c23c0b222206af6ef8370c0fa1d03d01844a0384fdef12c","abstract_canon_sha256":"d2d883d59355e4f92ce81d9c0c50584c4dfe52af1b544048b488901f4d5f8336"},"schema_version":"1.0"},"canonical_sha256":"b42b18f37a204750184aaf9b3a1f565960f55e4a224aecc091c115156fd88787","source":{"kind":"arxiv","id":"1801.02967","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02967","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02967v2","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02967","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"WQVRR432EBDV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WQVRR432EBDVAGCK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WQVRR432","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WQVRR432EBDVAGCKV6NTUH2WLF","target":"record","payload":{"canonical_record":{"source":{"id":"1801.02967","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-09T14:54:40Z","cross_cats_sorted":[],"title_canon_sha256":"52bf21e0132a1b401c23c0b222206af6ef8370c0fa1d03d01844a0384fdef12c","abstract_canon_sha256":"d2d883d59355e4f92ce81d9c0c50584c4dfe52af1b544048b488901f4d5f8336"},"schema_version":"1.0"},"canonical_sha256":"b42b18f37a204750184aaf9b3a1f565960f55e4a224aecc091c115156fd88787","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:52.728349Z","signature_b64":"7r/rnnytZuqg0Af+I6V+S3zZgwypSo7i2PIuCjwoyjTSyc1DWuavrdrcWIveClBtFuhnkwSTS+WCsDzGYCpSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b42b18f37a204750184aaf9b3a1f565960f55e4a224aecc091c115156fd88787","last_reissued_at":"2026-05-18T00:09:52.727606Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:52.727606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.02967","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-18T00:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O1PCAhL9yraUqG7dWvmrXQeJOUkiPFDGB16z5qZK6+qBDN1+aS5Hvck3GNqnZ1RC/1eLbacD07AK53Hqqm8/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:37:49.169558Z"},"content_sha256":"336b644c0dd1cf57bd6a7391b8f69c456c85c3c5483c3b036b1eb41448c517f1","schema_version":"1.0","event_id":"sha256:336b644c0dd1cf57bd6a7391b8f69c456c85c3c5483c3b036b1eb41448c517f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WQVRR432EBDVAGCKV6NTUH2WLF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous distributed algorithms for seeking generalized Nash equilibria under full and partial decision information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lacra Pavel, Peng Yi","submitted_at":"2018-01-09T14:54:40Z","abstract_excerpt":"We investigate asynchronous distributed algorithms with delayed information for seeking generalized Nash equilibrium over multi-agent networks. The considered game model has all players' local decisions coupled with a shared affine constraint. We assume each player can only access its local objective function, local constraint, and a local block matrix of the affine constraint. We first give the algorithm for the case when each agent is able to fully access all other players' decisions. With the help of auxiliary edge variables and edge Laplacian matrix, each player can carry on its local iter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02967","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-18T00:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RfSYNNTL3PeLxJbjWabOVkBUZuno395wYUQJcucGQbR92wQW2K7GiW3RhgOvSv7FJCicHvgAyZoqylyLVGZnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:37:49.169909Z"},"content_sha256":"86e62a76916d7572bfdd8feed19093b22c9f788c962f7608be260c4bc80bf469","schema_version":"1.0","event_id":"sha256:86e62a76916d7572bfdd8feed19093b22c9f788c962f7608be260c4bc80bf469"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQVRR432EBDVAGCKV6NTUH2WLF/bundle.json","state_url":"https://pith.science/pith/WQVRR432EBDVAGCKV6NTUH2WLF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQVRR432EBDVAGCKV6NTUH2WLF/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-06-07T14:37:49Z","links":{"resolver":"https://pith.science/pith/WQVRR432EBDVAGCKV6NTUH2WLF","bundle":"https://pith.science/pith/WQVRR432EBDVAGCKV6NTUH2WLF/bundle.json","state":"https://pith.science/pith/WQVRR432EBDVAGCKV6NTUH2WLF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQVRR432EBDVAGCKV6NTUH2WLF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WQVRR432EBDVAGCKV6NTUH2WLF","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":"d2d883d59355e4f92ce81d9c0c50584c4dfe52af1b544048b488901f4d5f8336","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-09T14:54:40Z","title_canon_sha256":"52bf21e0132a1b401c23c0b222206af6ef8370c0fa1d03d01844a0384fdef12c"},"schema_version":"1.0","source":{"id":"1801.02967","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02967","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02967v2","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02967","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"WQVRR432EBDV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WQVRR432EBDVAGCK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WQVRR432","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:86e62a76916d7572bfdd8feed19093b22c9f788c962f7608be260c4bc80bf469","target":"graph","created_at":"2026-05-18T00:09:52Z","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 investigate asynchronous distributed algorithms with delayed information for seeking generalized Nash equilibrium over multi-agent networks. The considered game model has all players' local decisions coupled with a shared affine constraint. We assume each player can only access its local objective function, local constraint, and a local block matrix of the affine constraint. We first give the algorithm for the case when each agent is able to fully access all other players' decisions. With the help of auxiliary edge variables and edge Laplacian matrix, each player can carry on its local iter","authors_text":"Lacra Pavel, Peng Yi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-09T14:54:40Z","title":"Asynchronous distributed algorithms for seeking generalized Nash equilibria under full and partial decision information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02967","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:336b644c0dd1cf57bd6a7391b8f69c456c85c3c5483c3b036b1eb41448c517f1","target":"record","created_at":"2026-05-18T00:09:52Z","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":"d2d883d59355e4f92ce81d9c0c50584c4dfe52af1b544048b488901f4d5f8336","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-09T14:54:40Z","title_canon_sha256":"52bf21e0132a1b401c23c0b222206af6ef8370c0fa1d03d01844a0384fdef12c"},"schema_version":"1.0","source":{"id":"1801.02967","kind":"arxiv","version":2}},"canonical_sha256":"b42b18f37a204750184aaf9b3a1f565960f55e4a224aecc091c115156fd88787","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b42b18f37a204750184aaf9b3a1f565960f55e4a224aecc091c115156fd88787","first_computed_at":"2026-05-18T00:09:52.727606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:52.727606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7r/rnnytZuqg0Af+I6V+S3zZgwypSo7i2PIuCjwoyjTSyc1DWuavrdrcWIveClBtFuhnkwSTS+WCsDzGYCpSCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:52.728349Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02967","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:336b644c0dd1cf57bd6a7391b8f69c456c85c3c5483c3b036b1eb41448c517f1","sha256:86e62a76916d7572bfdd8feed19093b22c9f788c962f7608be260c4bc80bf469"],"state_sha256":"ab4441bb529bc3f5c05fc5d8260c4889b009debb26298c13344f079431327184"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tHOVs82O2iS+ZGMRGaRqFxxO40jM9h9nbUsEpbGPzheHX80oMhYMI7NrDILXHC/DOe/jJml8coH9/K7QsCzeAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:37:49.171790Z","bundle_sha256":"fe20bb324cfd8bc0917bf4de0cdf2f1f76a78d5f2f8267d436df03036c4b548a"}}