{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3KXQE7DQFEAWZ4VFRIRUM23ZF4","short_pith_number":"pith:3KXQE7DQ","canonical_record":{"source":{"id":"1401.4432","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-17T18:40:54Z","cross_cats_sorted":[],"title_canon_sha256":"23080d0f157328c439d9577b46c37f22646e2e240c3f5485180d5e473e5ad6bd","abstract_canon_sha256":"9c241b46daf26a5267001954178b501620b97e4c5c319b8e56ba063f53ad7f0b"},"schema_version":"1.0"},"canonical_sha256":"daaf027c7029016cf2a58a23466b792f34c5fa258e2fa58fd370eac49546709e","source":{"kind":"arxiv","id":"1401.4432","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4432","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4432v3","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4432","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"pith_short_12","alias_value":"3KXQE7DQFEAW","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3KXQE7DQFEAWZ4VF","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3KXQE7DQ","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3KXQE7DQFEAWZ4VFRIRUM23ZF4","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4432","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-17T18:40:54Z","cross_cats_sorted":[],"title_canon_sha256":"23080d0f157328c439d9577b46c37f22646e2e240c3f5485180d5e473e5ad6bd","abstract_canon_sha256":"9c241b46daf26a5267001954178b501620b97e4c5c319b8e56ba063f53ad7f0b"},"schema_version":"1.0"},"canonical_sha256":"daaf027c7029016cf2a58a23466b792f34c5fa258e2fa58fd370eac49546709e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:40.288356Z","signature_b64":"d1p+YCzCTA//5pCpszimMzknVoEUNaDItaJIH74tRv5eF/6oXlcZhYeWCLsAHLyFvTO5cUJ8UTNNQWHlGjT6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daaf027c7029016cf2a58a23466b792f34c5fa258e2fa58fd370eac49546709e","last_reissued_at":"2026-05-18T02:44:40.287722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:40.287722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4432","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-18T02:44:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g1qVMzQKfGnGMJTY8PrZOzeptAuDdHmY1SG8rzeb5lb1bex+5sBoaHv5NJ10u8rcJGzi0cNnJa07cf9WuzFJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T13:56:24.493128Z"},"content_sha256":"aea166cd73710c25857c292f0a6d3f00a948706278aa6aaeb65c8e410973b0fb","schema_version":"1.0","event_id":"sha256:aea166cd73710c25857c292f0a6d3f00a948706278aa6aaeb65c8e410973b0fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3KXQE7DQFEAWZ4VFRIRUM23ZF4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jorge Cortes, Solmaz S. Kia, Sonia Martinez","submitted_at":"2014-01-17T18:40:54Z","abstract_excerpt":"This paper proposes a novel class of distributed continuous-time coordination algorithms to solve network optimization problems whose cost function is a sum of local cost functions associated to the individual agents. We establish the exponential convergence of the proposed algorithm under (i) strongly connected and weight-balanced digraph topologies when the local costs are strongly convex with globally Lipschitz gradients, and (ii) connected graph topologies when the local costs are strongly convex with locally Lipschitz gradients. When the local cost functions are convex and the global cost"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4432","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-18T02:44:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FqLGXi6zV5DG+352SZQW902GSV4ASMwQ5T/CaPGIsQ8jWN+wflSXQeEwq03TeG+zCDJw0FchoZQnj66TrFCwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T13:56:24.493740Z"},"content_sha256":"c664a29945e8baab8b16f064a6570a21b91bc614abc97b90c927f434398791b9","schema_version":"1.0","event_id":"sha256:c664a29945e8baab8b16f064a6570a21b91bc614abc97b90c927f434398791b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3KXQE7DQFEAWZ4VFRIRUM23ZF4/bundle.json","state_url":"https://pith.science/pith/3KXQE7DQFEAWZ4VFRIRUM23ZF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3KXQE7DQFEAWZ4VFRIRUM23ZF4/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-05-24T13:56:24Z","links":{"resolver":"https://pith.science/pith/3KXQE7DQFEAWZ4VFRIRUM23ZF4","bundle":"https://pith.science/pith/3KXQE7DQFEAWZ4VFRIRUM23ZF4/bundle.json","state":"https://pith.science/pith/3KXQE7DQFEAWZ4VFRIRUM23ZF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3KXQE7DQFEAWZ4VFRIRUM23ZF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3KXQE7DQFEAWZ4VFRIRUM23ZF4","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":"9c241b46daf26a5267001954178b501620b97e4c5c319b8e56ba063f53ad7f0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-17T18:40:54Z","title_canon_sha256":"23080d0f157328c439d9577b46c37f22646e2e240c3f5485180d5e473e5ad6bd"},"schema_version":"1.0","source":{"id":"1401.4432","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4432","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4432v3","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4432","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"pith_short_12","alias_value":"3KXQE7DQFEAW","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3KXQE7DQFEAWZ4VF","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3KXQE7DQ","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:c664a29945e8baab8b16f064a6570a21b91bc614abc97b90c927f434398791b9","target":"graph","created_at":"2026-05-18T02:44:40Z","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 proposes a novel class of distributed continuous-time coordination algorithms to solve network optimization problems whose cost function is a sum of local cost functions associated to the individual agents. We establish the exponential convergence of the proposed algorithm under (i) strongly connected and weight-balanced digraph topologies when the local costs are strongly convex with globally Lipschitz gradients, and (ii) connected graph topologies when the local costs are strongly convex with locally Lipschitz gradients. When the local cost functions are convex and the global cost","authors_text":"Jorge Cortes, Solmaz S. Kia, Sonia Martinez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-17T18:40:54Z","title":"Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4432","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:aea166cd73710c25857c292f0a6d3f00a948706278aa6aaeb65c8e410973b0fb","target":"record","created_at":"2026-05-18T02:44:40Z","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":"9c241b46daf26a5267001954178b501620b97e4c5c319b8e56ba063f53ad7f0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-17T18:40:54Z","title_canon_sha256":"23080d0f157328c439d9577b46c37f22646e2e240c3f5485180d5e473e5ad6bd"},"schema_version":"1.0","source":{"id":"1401.4432","kind":"arxiv","version":3}},"canonical_sha256":"daaf027c7029016cf2a58a23466b792f34c5fa258e2fa58fd370eac49546709e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"daaf027c7029016cf2a58a23466b792f34c5fa258e2fa58fd370eac49546709e","first_computed_at":"2026-05-18T02:44:40.287722Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:40.287722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d1p+YCzCTA//5pCpszimMzknVoEUNaDItaJIH74tRv5eF/6oXlcZhYeWCLsAHLyFvTO5cUJ8UTNNQWHlGjT6Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:40.288356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4432","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aea166cd73710c25857c292f0a6d3f00a948706278aa6aaeb65c8e410973b0fb","sha256:c664a29945e8baab8b16f064a6570a21b91bc614abc97b90c927f434398791b9"],"state_sha256":"0c43d2032718610dde86f4c0155892c5c9f1c13699ad69bbfcb1499fd0d7a77a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"28n1sZoTrOcDEQRp35A93q+xvwTzkGyUT3nm0mgOU6jDy2oLRwaUsNRs8XL/xJqJxrcEXoizQMZ6QNC7wxeGAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T13:56:24.497504Z","bundle_sha256":"84231a1921f2517f5fca25f5047f375d4b9199ddf95c2dc8c85ca01736300224"}}