{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WIXGGG7AOH4AQ25SGR6F55HI4W","short_pith_number":"pith:WIXGGG7A","canonical_record":{"source":{"id":"1512.00895","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-02T22:52:58Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"19e2a4be687174d52544d85616eb21b505f4a4265257663edb8f8c204e2d17ef","abstract_canon_sha256":"5292d86208dd538a98c01d9277d79e3eefd90a296ddd435762b4adc94ee90982"},"schema_version":"1.0"},"canonical_sha256":"b22e631be071f8086bb2347c5ef4e8e5ab4248cca5a07e5132e555a9caeb32ed","source":{"kind":"arxiv","id":"1512.00895","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00895","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00895v2","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00895","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"WIXGGG7AOH4A","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WIXGGG7AOH4AQ25S","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WIXGGG7A","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WIXGGG7AOH4AQ25SGR6F55HI4W","target":"record","payload":{"canonical_record":{"source":{"id":"1512.00895","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-02T22:52:58Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"19e2a4be687174d52544d85616eb21b505f4a4265257663edb8f8c204e2d17ef","abstract_canon_sha256":"5292d86208dd538a98c01d9277d79e3eefd90a296ddd435762b4adc94ee90982"},"schema_version":"1.0"},"canonical_sha256":"b22e631be071f8086bb2347c5ef4e8e5ab4248cca5a07e5132e555a9caeb32ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:58.398282Z","signature_b64":"lH4d+Jlujqd36VEKd1xoMULoxWWWVUT6TbTJcsPg/b3F52zacxwcIdRcUKqsbyeG3HfWaR/v+L3aVE7x9ii0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b22e631be071f8086bb2347c5ef4e8e5ab4248cca5a07e5132e555a9caeb32ed","last_reissued_at":"2026-05-18T00:55:58.397816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:58.397816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.00895","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:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hrduzPoKisJMql945Onc5cZE+e4f5kE7l5nh/h3eekgN6+CzWZTU0gp6ii0o4fX1bCvBvTm1w2YFx79XwVAFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:58:37.995331Z"},"content_sha256":"f66133cbc9156bf632890ccb5fda7f70d2cd5fe008589b17490fd61d0a41aa1b","schema_version":"1.0","event_id":"sha256:f66133cbc9156bf632890ccb5fda7f70d2cd5fe008589b17490fd61d0a41aa1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WIXGGG7AOH4AQ25SGR6F55HI4W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Convex Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Behrouz Touri, Tatiana Tatarenko","submitted_at":"2015-12-02T22:52:58Z","abstract_excerpt":"We study distributed non-convex optimization on a time-varying multi-agent network. Each node has access to its own smooth local cost function, and the collective goal is to minimize the sum of these functions. We generalize the results obtained previously to the case of non-convex functions. Under some additional technical assumptions on the gradients we prove the convergence of the distributed push-sum algorithm to some critical point of the objective function. By utilizing perturbations on the update process, we show the almost sure convergence of the perturbed dynamics to a local minimum o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00895","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:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ep42fvnECnWuu8hcIozBo4cNxi9xiAvQ+Gy7+EA743SSSX31H1d98NiT+CzSLO2UGjms/j7rNZoQsJxbQ9XLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:58:37.995676Z"},"content_sha256":"018c42e6d61e0b373c016fd80efc035e6f31f1452a64bfcaae76a7aa3c8678ef","schema_version":"1.0","event_id":"sha256:018c42e6d61e0b373c016fd80efc035e6f31f1452a64bfcaae76a7aa3c8678ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WIXGGG7AOH4AQ25SGR6F55HI4W/bundle.json","state_url":"https://pith.science/pith/WIXGGG7AOH4AQ25SGR6F55HI4W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WIXGGG7AOH4AQ25SGR6F55HI4W/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-10T21:58:37Z","links":{"resolver":"https://pith.science/pith/WIXGGG7AOH4AQ25SGR6F55HI4W","bundle":"https://pith.science/pith/WIXGGG7AOH4AQ25SGR6F55HI4W/bundle.json","state":"https://pith.science/pith/WIXGGG7AOH4AQ25SGR6F55HI4W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WIXGGG7AOH4AQ25SGR6F55HI4W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WIXGGG7AOH4AQ25SGR6F55HI4W","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":"5292d86208dd538a98c01d9277d79e3eefd90a296ddd435762b4adc94ee90982","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-02T22:52:58Z","title_canon_sha256":"19e2a4be687174d52544d85616eb21b505f4a4265257663edb8f8c204e2d17ef"},"schema_version":"1.0","source":{"id":"1512.00895","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00895","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00895v2","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00895","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"WIXGGG7AOH4A","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WIXGGG7AOH4AQ25S","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WIXGGG7A","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:018c42e6d61e0b373c016fd80efc035e6f31f1452a64bfcaae76a7aa3c8678ef","target":"graph","created_at":"2026-05-18T00:55:58Z","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 study distributed non-convex optimization on a time-varying multi-agent network. Each node has access to its own smooth local cost function, and the collective goal is to minimize the sum of these functions. We generalize the results obtained previously to the case of non-convex functions. Under some additional technical assumptions on the gradients we prove the convergence of the distributed push-sum algorithm to some critical point of the objective function. By utilizing perturbations on the update process, we show the almost sure convergence of the perturbed dynamics to a local minimum o","authors_text":"Behrouz Touri, Tatiana Tatarenko","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-02T22:52:58Z","title":"Non-Convex Distributed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00895","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:f66133cbc9156bf632890ccb5fda7f70d2cd5fe008589b17490fd61d0a41aa1b","target":"record","created_at":"2026-05-18T00:55:58Z","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":"5292d86208dd538a98c01d9277d79e3eefd90a296ddd435762b4adc94ee90982","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-02T22:52:58Z","title_canon_sha256":"19e2a4be687174d52544d85616eb21b505f4a4265257663edb8f8c204e2d17ef"},"schema_version":"1.0","source":{"id":"1512.00895","kind":"arxiv","version":2}},"canonical_sha256":"b22e631be071f8086bb2347c5ef4e8e5ab4248cca5a07e5132e555a9caeb32ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b22e631be071f8086bb2347c5ef4e8e5ab4248cca5a07e5132e555a9caeb32ed","first_computed_at":"2026-05-18T00:55:58.397816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:58.397816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lH4d+Jlujqd36VEKd1xoMULoxWWWVUT6TbTJcsPg/b3F52zacxwcIdRcUKqsbyeG3HfWaR/v+L3aVE7x9ii0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:58.398282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.00895","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f66133cbc9156bf632890ccb5fda7f70d2cd5fe008589b17490fd61d0a41aa1b","sha256:018c42e6d61e0b373c016fd80efc035e6f31f1452a64bfcaae76a7aa3c8678ef"],"state_sha256":"d6389157eb8af23ad158262086c11771164fa8dca83dae691078a284110dc459"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Ahdo/mKvjp0g5g5x0xtv63YthnkqnOCZZ9muLrpdvB4nY3CMfn0q7CWb0mI4xTfXrDBpg7VftGTS5ZIdGdFAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:58:37.997576Z","bundle_sha256":"f8ab7272bced741cfe94ff06a0ec41f5a69067df8d9598052b94746f5f85fd04"}}