{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SXNAVE7SUOPMLTWA5VLGZIJV47","short_pith_number":"pith:SXNAVE7S","canonical_record":{"source":{"id":"1107.2526","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-13T11:21:14Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"5991fa2c2d3489c32be3a5e94b3dbd352694eeaf15c9bba521e98bdaa2de3745","abstract_canon_sha256":"ded553429b8cf232727190145a7352c943905f45cef12ecf82ad27da01901918"},"schema_version":"1.0"},"canonical_sha256":"95da0a93f2a39ec5cec0ed566ca135e7cd13ea7c20aa883e7cab0df12a560223","source":{"kind":"arxiv","id":"1107.2526","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2526","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2526v3","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2526","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"SXNAVE7SUOPM","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SXNAVE7SUOPMLTWA","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SXNAVE7S","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SXNAVE7SUOPMLTWA5VLGZIJV47","target":"record","payload":{"canonical_record":{"source":{"id":"1107.2526","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-13T11:21:14Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"5991fa2c2d3489c32be3a5e94b3dbd352694eeaf15c9bba521e98bdaa2de3745","abstract_canon_sha256":"ded553429b8cf232727190145a7352c943905f45cef12ecf82ad27da01901918"},"schema_version":"1.0"},"canonical_sha256":"95da0a93f2a39ec5cec0ed566ca135e7cd13ea7c20aa883e7cab0df12a560223","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:55.268099Z","signature_b64":"doI7fZyrnghud0WIOBbqG9vPwydeGWzbNnAEY7WFja7RrDZkjS0g5zh3kHFby3LcHZ+nATlHZ+/++de7IyfkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95da0a93f2a39ec5cec0ed566ca135e7cd13ea7c20aa883e7cab0df12a560223","last_reissued_at":"2026-05-18T03:05:55.267572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:55.267572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.2526","source_version":3,"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-18T03:05:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pAkpVhM2Fym5YCyd0vV7aTin/YLDPTo2IqVALrDXprnQDe6HqbK7jtOooUpRdWQGAPnHIEtCpo+Kx5+8N9tQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:49:21.647132Z"},"content_sha256":"cd91474cabc3b8da67ec3f9517543ac7bde8c7db74b63bb7481381a160301e19","schema_version":"1.0","event_id":"sha256:cd91474cabc3b8da67ec3f9517543ac7bde8c7db74b63bb7481381a160301e19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SXNAVE7SUOPMLTWA5VLGZIJV47","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence of a Multi-Agent Projected Stochastic Gradient Algorithm for Non-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY"],"primary_cat":"math.OC","authors_text":"J\\'er\\'emie Jakubowicz, Pascal Bianchi","submitted_at":"2011-07-13T11:21:14Z","abstract_excerpt":"We introduce a new framework for the convergence analysis of a class of distributed constrained non-convex optimization algorithms in multi-agent systems. The aim is to search for local minimizers of a non-convex objective function which is supposed to be a sum of local utility functions of the agents. The algorithm under study consists of two steps: a local stochastic gradient descent at each agent and a gossip step that drives the network of agents to a consensus. Under the assumption of decreasing stepsize, it is proved that consensus is asymptotically achieved in the network and that the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2526","kind":"arxiv","version":3},"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-18T03:05:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"14Q1KcY+9RiDGXULYBST6BevYHFnVATe7+4uFBBHfY/8BaHgdmXxKzetjOpNz6yoPc4muJW1SeR5aTc9m1EhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:49:21.647788Z"},"content_sha256":"7017364ae20f0176501d879bfecb772ab3ebe78fbe37db9182b8f06866a64c78","schema_version":"1.0","event_id":"sha256:7017364ae20f0176501d879bfecb772ab3ebe78fbe37db9182b8f06866a64c78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SXNAVE7SUOPMLTWA5VLGZIJV47/bundle.json","state_url":"https://pith.science/pith/SXNAVE7SUOPMLTWA5VLGZIJV47/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SXNAVE7SUOPMLTWA5VLGZIJV47/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-01T12:49:21Z","links":{"resolver":"https://pith.science/pith/SXNAVE7SUOPMLTWA5VLGZIJV47","bundle":"https://pith.science/pith/SXNAVE7SUOPMLTWA5VLGZIJV47/bundle.json","state":"https://pith.science/pith/SXNAVE7SUOPMLTWA5VLGZIJV47/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SXNAVE7SUOPMLTWA5VLGZIJV47/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SXNAVE7SUOPMLTWA5VLGZIJV47","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":"ded553429b8cf232727190145a7352c943905f45cef12ecf82ad27da01901918","cross_cats_sorted":["cs.DC","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-13T11:21:14Z","title_canon_sha256":"5991fa2c2d3489c32be3a5e94b3dbd352694eeaf15c9bba521e98bdaa2de3745"},"schema_version":"1.0","source":{"id":"1107.2526","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2526","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2526v3","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2526","created_at":"2026-05-18T03:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"SXNAVE7SUOPM","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SXNAVE7SUOPMLTWA","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SXNAVE7S","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:7017364ae20f0176501d879bfecb772ab3ebe78fbe37db9182b8f06866a64c78","target":"graph","created_at":"2026-05-18T03:05: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":"We introduce a new framework for the convergence analysis of a class of distributed constrained non-convex optimization algorithms in multi-agent systems. The aim is to search for local minimizers of a non-convex objective function which is supposed to be a sum of local utility functions of the agents. The algorithm under study consists of two steps: a local stochastic gradient descent at each agent and a gossip step that drives the network of agents to a consensus. Under the assumption of decreasing stepsize, it is proved that consensus is asymptotically achieved in the network and that the a","authors_text":"J\\'er\\'emie Jakubowicz, Pascal Bianchi","cross_cats":["cs.DC","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-13T11:21:14Z","title":"Convergence of a Multi-Agent Projected Stochastic Gradient Algorithm for Non-Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2526","kind":"arxiv","version":3},"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:cd91474cabc3b8da67ec3f9517543ac7bde8c7db74b63bb7481381a160301e19","target":"record","created_at":"2026-05-18T03:05: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":"ded553429b8cf232727190145a7352c943905f45cef12ecf82ad27da01901918","cross_cats_sorted":["cs.DC","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-13T11:21:14Z","title_canon_sha256":"5991fa2c2d3489c32be3a5e94b3dbd352694eeaf15c9bba521e98bdaa2de3745"},"schema_version":"1.0","source":{"id":"1107.2526","kind":"arxiv","version":3}},"canonical_sha256":"95da0a93f2a39ec5cec0ed566ca135e7cd13ea7c20aa883e7cab0df12a560223","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95da0a93f2a39ec5cec0ed566ca135e7cd13ea7c20aa883e7cab0df12a560223","first_computed_at":"2026-05-18T03:05:55.267572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:55.267572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"doI7fZyrnghud0WIOBbqG9vPwydeGWzbNnAEY7WFja7RrDZkjS0g5zh3kHFby3LcHZ+nATlHZ+/++de7IyfkAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:55.268099Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2526","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd91474cabc3b8da67ec3f9517543ac7bde8c7db74b63bb7481381a160301e19","sha256:7017364ae20f0176501d879bfecb772ab3ebe78fbe37db9182b8f06866a64c78"],"state_sha256":"d526b1575dce101b2e653cfe1f4139a02795741c33ae6d4124ab4dff38b7e493"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VFpH6WHnpXdOtm//rbonvDIdnFRSXs8DtqfmYCKhp43Hq9Q5aYnOCswVlq7XQ8G9Y36NMZLodzQho3TPAHVoDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:49:21.650891Z","bundle_sha256":"0a72ad6980df87cbf2eb75495a22570275838af16eda508585363e35dfa90524"}}