{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CCK6GHTKHV3I637U5FIIU2MERR","short_pith_number":"pith:CCK6GHTK","canonical_record":{"source":{"id":"1507.01530","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-06T16:35:36Z","cross_cats_sorted":[],"title_canon_sha256":"a38531da21c252dbde0f04bbc6633f92ffde2081e40f2e0a279b47e32e75e9bd","abstract_canon_sha256":"36d19d8d18449c780ff3037824fd6fb427e4b6ee104fd35d23e41b4060cdf99f"},"schema_version":"1.0"},"canonical_sha256":"1095e31e6a3d768f6ff4e9508a69848c5910402b49bce83a80064354d3416e76","source":{"kind":"arxiv","id":"1507.01530","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01530","created_at":"2026-05-18T01:32:28Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01530v2","created_at":"2026-05-18T01:32:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01530","created_at":"2026-05-18T01:32:28Z"},{"alias_kind":"pith_short_12","alias_value":"CCK6GHTKHV3I","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CCK6GHTKHV3I637U","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CCK6GHTK","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CCK6GHTKHV3I637U5FIIU2MERR","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01530","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-06T16:35:36Z","cross_cats_sorted":[],"title_canon_sha256":"a38531da21c252dbde0f04bbc6633f92ffde2081e40f2e0a279b47e32e75e9bd","abstract_canon_sha256":"36d19d8d18449c780ff3037824fd6fb427e4b6ee104fd35d23e41b4060cdf99f"},"schema_version":"1.0"},"canonical_sha256":"1095e31e6a3d768f6ff4e9508a69848c5910402b49bce83a80064354d3416e76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:28.868300Z","signature_b64":"s50Fg02xO2YjyhsACLxCaU/ErxTrAtzuzt3MRZtH7eqZy0lTeXCEthqPMqMNfK2Wr2+9X0bKK2KLIDV5rlZoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1095e31e6a3d768f6ff4e9508a69848c5910402b49bce83a80064354d3416e76","last_reissued_at":"2026-05-18T01:32:28.867812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:28.867812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01530","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:32:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZXrgC7iN+0022Jn0BXc5NP3txndi0Kd/5cd7Yb1Pq/5oVtizuV9PpzvqlK1JDWCOPGkNDbNsymFsAEvoZNWgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:51:37.409607Z"},"content_sha256":"091dcc3a244b890c41ff6896744fad3cf31eef6a9d49324f0e9d3d0c930a8d7f","schema_version":"1.0","event_id":"sha256:091dcc3a244b890c41ff6896744fad3cf31eef6a9d49324f0e9d3d0c930a8d7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CCK6GHTKHV3I637U5FIIU2MERR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed robust adaptive equilibrium computation for generalized convex games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Emilio Frazzoli, Minghui Zhu","submitted_at":"2015-07-06T16:35:36Z","abstract_excerpt":"This paper considers a class of generalized convex games where each player is associated with a convex objective function, a convex inequality constraint and a convex constraint set. The players aim to compute a Nash equilibrium through communicating with neighboring players. The particular challenge we consider is that the component functions are unknown a priori to associated players. We study two distributed computation algorithms and analyze their convergence properties in the presence of data transmission delays and dynamic changes of network topologies. The algorithm performance is verif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01530","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:32:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TVTc7NqsNcHxh5MtgN3TZdvKmxPU2Dcl8fWaAqGpC6fnelMwA/rdK1bPYCzxW4ZHl/67cbA2Qi6jxFJRPW3rDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:51:37.409989Z"},"content_sha256":"b1f04561355df2cde7cffaa4fa11220da1277472f90b13c7b806ff006576ce7a","schema_version":"1.0","event_id":"sha256:b1f04561355df2cde7cffaa4fa11220da1277472f90b13c7b806ff006576ce7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CCK6GHTKHV3I637U5FIIU2MERR/bundle.json","state_url":"https://pith.science/pith/CCK6GHTKHV3I637U5FIIU2MERR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CCK6GHTKHV3I637U5FIIU2MERR/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-11T16:51:37Z","links":{"resolver":"https://pith.science/pith/CCK6GHTKHV3I637U5FIIU2MERR","bundle":"https://pith.science/pith/CCK6GHTKHV3I637U5FIIU2MERR/bundle.json","state":"https://pith.science/pith/CCK6GHTKHV3I637U5FIIU2MERR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CCK6GHTKHV3I637U5FIIU2MERR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CCK6GHTKHV3I637U5FIIU2MERR","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":"36d19d8d18449c780ff3037824fd6fb427e4b6ee104fd35d23e41b4060cdf99f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-06T16:35:36Z","title_canon_sha256":"a38531da21c252dbde0f04bbc6633f92ffde2081e40f2e0a279b47e32e75e9bd"},"schema_version":"1.0","source":{"id":"1507.01530","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01530","created_at":"2026-05-18T01:32:28Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01530v2","created_at":"2026-05-18T01:32:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01530","created_at":"2026-05-18T01:32:28Z"},{"alias_kind":"pith_short_12","alias_value":"CCK6GHTKHV3I","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CCK6GHTKHV3I637U","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CCK6GHTK","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:b1f04561355df2cde7cffaa4fa11220da1277472f90b13c7b806ff006576ce7a","target":"graph","created_at":"2026-05-18T01:32:28Z","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":"This paper considers a class of generalized convex games where each player is associated with a convex objective function, a convex inequality constraint and a convex constraint set. The players aim to compute a Nash equilibrium through communicating with neighboring players. The particular challenge we consider is that the component functions are unknown a priori to associated players. We study two distributed computation algorithms and analyze their convergence properties in the presence of data transmission delays and dynamic changes of network topologies. The algorithm performance is verif","authors_text":"Emilio Frazzoli, Minghui Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-06T16:35:36Z","title":"Distributed robust adaptive equilibrium computation for generalized convex games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01530","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:091dcc3a244b890c41ff6896744fad3cf31eef6a9d49324f0e9d3d0c930a8d7f","target":"record","created_at":"2026-05-18T01:32:28Z","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":"36d19d8d18449c780ff3037824fd6fb427e4b6ee104fd35d23e41b4060cdf99f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-06T16:35:36Z","title_canon_sha256":"a38531da21c252dbde0f04bbc6633f92ffde2081e40f2e0a279b47e32e75e9bd"},"schema_version":"1.0","source":{"id":"1507.01530","kind":"arxiv","version":2}},"canonical_sha256":"1095e31e6a3d768f6ff4e9508a69848c5910402b49bce83a80064354d3416e76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1095e31e6a3d768f6ff4e9508a69848c5910402b49bce83a80064354d3416e76","first_computed_at":"2026-05-18T01:32:28.867812Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:28.867812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s50Fg02xO2YjyhsACLxCaU/ErxTrAtzuzt3MRZtH7eqZy0lTeXCEthqPMqMNfK2Wr2+9X0bKK2KLIDV5rlZoBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:28.868300Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01530","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:091dcc3a244b890c41ff6896744fad3cf31eef6a9d49324f0e9d3d0c930a8d7f","sha256:b1f04561355df2cde7cffaa4fa11220da1277472f90b13c7b806ff006576ce7a"],"state_sha256":"a0332ff573eb964fba9caaf0087d795e856b90bcba61c22e17b6e89c8edd7196"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ahn4sl+tPDW8ZsWlZXc/4yQLFfisd+C+277jIiw//ZtMba3C4J0qN6sURJb8v1w0yaqAw1GJhEgUq+wC09OqAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T16:51:37.413777Z","bundle_sha256":"e7df8beebca520b4f9231f9e87251bf383079ac9f89cb00be89d1d8456f871ad"}}