{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4FWTL6JVG4OFALCGWTRPXJ5UYM","short_pith_number":"pith:4FWTL6JV","canonical_record":{"source":{"id":"1902.05900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-14T02:38:13Z","cross_cats_sorted":[],"title_canon_sha256":"8486978058feac2a4c6a45e5df996a229f42e6b58dcf9fd771fe08c396a78e16","abstract_canon_sha256":"27f2ea5b1fd47a851b0dd302bc08c95d38b77a9f7c065743183b749fc1d80764"},"schema_version":"1.0"},"canonical_sha256":"e16d35f935371c502c46b4e2fba7b4c31ef28d815736293809bb24d76d3ca1a9","source":{"kind":"arxiv","id":"1902.05900","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05900","created_at":"2026-05-17T23:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05900v1","created_at":"2026-05-17T23:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05900","created_at":"2026-05-17T23:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"4FWTL6JVG4OF","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4FWTL6JVG4OFALCG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4FWTL6JV","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4FWTL6JVG4OFALCGWTRPXJ5UYM","target":"record","payload":{"canonical_record":{"source":{"id":"1902.05900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-14T02:38:13Z","cross_cats_sorted":[],"title_canon_sha256":"8486978058feac2a4c6a45e5df996a229f42e6b58dcf9fd771fe08c396a78e16","abstract_canon_sha256":"27f2ea5b1fd47a851b0dd302bc08c95d38b77a9f7c065743183b749fc1d80764"},"schema_version":"1.0"},"canonical_sha256":"e16d35f935371c502c46b4e2fba7b4c31ef28d815736293809bb24d76d3ca1a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:55.176382Z","signature_b64":"I4A+dwIC0gpFMRCZPMOMSWtZlHrKIoHRYwCugFpqfsLKxrynAi6kfi1mXTyS94WTAnM66SDrvai6hR/z0tsJAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e16d35f935371c502c46b4e2fba7b4c31ef28d815736293809bb24d76d3ca1a9","last_reissued_at":"2026-05-17T23:53:55.175755Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:55.175755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.05900","source_version":1,"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-17T23:53:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hQ/wDOdT4XubUggtqEzinvbTu+5RnWT0AYYK7VDKFf+JoDN/ihAgCaxb4xDgBcM4+milVz3vFvZ/ORVHfdorCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:23:53.159931Z"},"content_sha256":"65d487e73fd42dfa8ff8ea7b63d7d5d4ad9f16becd922c6ce7ddf56ce4354350","schema_version":"1.0","event_id":"sha256:65d487e73fd42dfa8ff8ea7b63d7d5d4ad9f16becd922c6ce7ddf56ce4354350"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4FWTL6JVG4OFALCGWTRPXJ5UYM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"First-order Methods with Convergence Rates for Multi-agent Systems on Semidefinite Matrix Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Farzad Yousefian, Mohammad Javad Feizollahi, Nahidsadat Majlesinasab","submitted_at":"2019-02-14T02:38:13Z","abstract_excerpt":"The goal in this paper is to develop first-order methods equipped with convergence rates for multi-agent optimization problems on semidefinite matrix spaces. These problems include cooperative optimization problems and non-cooperative Nash games. Accordingly, first we consider a multi-agent system where the agents cooperatively minimize the summation of their local convex objectives, and second, we consider Cartesian stochastic variational inequality (CSVI) problems with monotone mappings for addressing stochastic Nash games on semidefinite matrix spaces. Despite the recent advancements in fir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05900","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"},"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-17T23:53:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W7vjk7HDuBk8pi7kBxq7HXf68G/wQ0CODRjDDoUH4S3M78XTxBuvqjsJ063Gg0FiNQHAlQ/mMrXPVb9pm+TzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:23:53.160569Z"},"content_sha256":"139470f29972f30085fe2bfc026c208b1946e521015fbe24defceed38b43f054","schema_version":"1.0","event_id":"sha256:139470f29972f30085fe2bfc026c208b1946e521015fbe24defceed38b43f054"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4FWTL6JVG4OFALCGWTRPXJ5UYM/bundle.json","state_url":"https://pith.science/pith/4FWTL6JVG4OFALCGWTRPXJ5UYM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4FWTL6JVG4OFALCGWTRPXJ5UYM/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-12T01:23:53Z","links":{"resolver":"https://pith.science/pith/4FWTL6JVG4OFALCGWTRPXJ5UYM","bundle":"https://pith.science/pith/4FWTL6JVG4OFALCGWTRPXJ5UYM/bundle.json","state":"https://pith.science/pith/4FWTL6JVG4OFALCGWTRPXJ5UYM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4FWTL6JVG4OFALCGWTRPXJ5UYM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4FWTL6JVG4OFALCGWTRPXJ5UYM","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":"27f2ea5b1fd47a851b0dd302bc08c95d38b77a9f7c065743183b749fc1d80764","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-14T02:38:13Z","title_canon_sha256":"8486978058feac2a4c6a45e5df996a229f42e6b58dcf9fd771fe08c396a78e16"},"schema_version":"1.0","source":{"id":"1902.05900","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05900","created_at":"2026-05-17T23:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05900v1","created_at":"2026-05-17T23:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05900","created_at":"2026-05-17T23:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"4FWTL6JVG4OF","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4FWTL6JVG4OFALCG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4FWTL6JV","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:139470f29972f30085fe2bfc026c208b1946e521015fbe24defceed38b43f054","target":"graph","created_at":"2026-05-17T23:53:55Z","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":"The goal in this paper is to develop first-order methods equipped with convergence rates for multi-agent optimization problems on semidefinite matrix spaces. These problems include cooperative optimization problems and non-cooperative Nash games. Accordingly, first we consider a multi-agent system where the agents cooperatively minimize the summation of their local convex objectives, and second, we consider Cartesian stochastic variational inequality (CSVI) problems with monotone mappings for addressing stochastic Nash games on semidefinite matrix spaces. Despite the recent advancements in fir","authors_text":"Farzad Yousefian, Mohammad Javad Feizollahi, Nahidsadat Majlesinasab","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-14T02:38:13Z","title":"First-order Methods with Convergence Rates for Multi-agent Systems on Semidefinite Matrix Spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05900","kind":"arxiv","version":1},"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:65d487e73fd42dfa8ff8ea7b63d7d5d4ad9f16becd922c6ce7ddf56ce4354350","target":"record","created_at":"2026-05-17T23:53:55Z","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":"27f2ea5b1fd47a851b0dd302bc08c95d38b77a9f7c065743183b749fc1d80764","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-14T02:38:13Z","title_canon_sha256":"8486978058feac2a4c6a45e5df996a229f42e6b58dcf9fd771fe08c396a78e16"},"schema_version":"1.0","source":{"id":"1902.05900","kind":"arxiv","version":1}},"canonical_sha256":"e16d35f935371c502c46b4e2fba7b4c31ef28d815736293809bb24d76d3ca1a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e16d35f935371c502c46b4e2fba7b4c31ef28d815736293809bb24d76d3ca1a9","first_computed_at":"2026-05-17T23:53:55.175755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:55.175755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I4A+dwIC0gpFMRCZPMOMSWtZlHrKIoHRYwCugFpqfsLKxrynAi6kfi1mXTyS94WTAnM66SDrvai6hR/z0tsJAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:55.176382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.05900","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65d487e73fd42dfa8ff8ea7b63d7d5d4ad9f16becd922c6ce7ddf56ce4354350","sha256:139470f29972f30085fe2bfc026c208b1946e521015fbe24defceed38b43f054"],"state_sha256":"aad7e4c0916b539c4bdee741acf9636c9b552ba7bce467c14f39d07daf19a788"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UOz0X77ORLIVPgcWn4J2KgKYpIQQGZymWQ3Z7VbKt15bGzwgsh3I0UN6FnR+zzkUcEogg8iIYxhzudQUle/yBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T01:23:53.163683Z","bundle_sha256":"58b4e81bc0aa5c557dbf20ca5aa97cccdb7f1b86c0f68968796289f9a48cf58c"}}