{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O6KBPGNA6SQYCZQXE2W2X32MJY","short_pith_number":"pith:O6KBPGNA","canonical_record":{"source":{"id":"1807.08684","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-07-23T15:49:07Z","cross_cats_sorted":[],"title_canon_sha256":"4a8eff342ba2f5c262ee3db067a51eb1e1db9d365f728f522a93632965437ea4","abstract_canon_sha256":"13da7a16c368c82195d25e71b4c33348b1970f43e053e043a429c2867d50828a"},"schema_version":"1.0"},"canonical_sha256":"77941799a0f4a181661726adabef4c4e358ce9a2390735316c787cec51e42039","source":{"kind":"arxiv","id":"1807.08684","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08684","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08684v3","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08684","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"pith_short_12","alias_value":"O6KBPGNA6SQY","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O6KBPGNA6SQYCZQX","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O6KBPGNA","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O6KBPGNA6SQYCZQXE2W2X32MJY","target":"record","payload":{"canonical_record":{"source":{"id":"1807.08684","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-07-23T15:49:07Z","cross_cats_sorted":[],"title_canon_sha256":"4a8eff342ba2f5c262ee3db067a51eb1e1db9d365f728f522a93632965437ea4","abstract_canon_sha256":"13da7a16c368c82195d25e71b4c33348b1970f43e053e043a429c2867d50828a"},"schema_version":"1.0"},"canonical_sha256":"77941799a0f4a181661726adabef4c4e358ce9a2390735316c787cec51e42039","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:11.209778Z","signature_b64":"HZW5mZaM6fR8rSPrJqWhCBRNEdA5lWmXf3eeup6dvWe6cGmoglahdCQtpEKv/4y4RkHsG/mLvYCbC7Snkun/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77941799a0f4a181661726adabef4c4e358ce9a2390735316c787cec51e42039","last_reissued_at":"2026-05-18T00:06:11.209039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:11.209039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.08684","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-18T00:06:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wax1n8XgqYViaNDUgA3K8YN/KKMNoTirOKH0+8IggHm9VFy8ikP76zzcfIRma3yBc0Nd+1X8iXtWxMpBX7khCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:18:55.111343Z"},"content_sha256":"8e35a9e3c0c4d67c98a299b0a512d0601a7f63b2e21734c69f87945c7bd26b3e","schema_version":"1.0","event_id":"sha256:8e35a9e3c0c4d67c98a299b0a512d0601a7f63b2e21734c69f87945c7bd26b3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O6KBPGNA6SQYCZQXE2W2X32MJY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Primal-Dual Gradient Flow Algorithm for Distributed Support Vector Machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Navdeep Singh, Prashant Bansode, Sushant Bahadure","submitted_at":"2018-07-23T15:49:07Z","abstract_excerpt":"In this paper, a primal-dual gradient flow algorithm for distributed support vector machines (DSVM) is proposed. A network of computing nodes, each carrying a subset of horizontally partitioned large dataset is considered. The nodes are represented as dynamical systems with Arrow-Hurwicz-Uzawa gradient flow dynamics, derived from the Lagrangian function of the DSVM problem. It is first proved that the nodes are passive dynamical systems. Then, by employing the Krasovskii type candidate Lyapunov functions, it is proved that the computing nodes asymptotically converge to the optimal primal-dual "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08684","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-18T00:06:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J4G7jC9Ir1SkAZPmU5MB7ArRg7M+39o9Auf53afElAiGoV72rjscSWPZ8VnDFx8tvv+VLDrCJcXvwWviORmOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:18:55.112084Z"},"content_sha256":"8a3dff000bf298b06cd87c8e3ebc2f6a3f4c72ec5008de82ad39b1a300a415d5","schema_version":"1.0","event_id":"sha256:8a3dff000bf298b06cd87c8e3ebc2f6a3f4c72ec5008de82ad39b1a300a415d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6KBPGNA6SQYCZQXE2W2X32MJY/bundle.json","state_url":"https://pith.science/pith/O6KBPGNA6SQYCZQXE2W2X32MJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6KBPGNA6SQYCZQXE2W2X32MJY/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-09T17:18:55Z","links":{"resolver":"https://pith.science/pith/O6KBPGNA6SQYCZQXE2W2X32MJY","bundle":"https://pith.science/pith/O6KBPGNA6SQYCZQXE2W2X32MJY/bundle.json","state":"https://pith.science/pith/O6KBPGNA6SQYCZQXE2W2X32MJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6KBPGNA6SQYCZQXE2W2X32MJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O6KBPGNA6SQYCZQXE2W2X32MJY","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":"13da7a16c368c82195d25e71b4c33348b1970f43e053e043a429c2867d50828a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-07-23T15:49:07Z","title_canon_sha256":"4a8eff342ba2f5c262ee3db067a51eb1e1db9d365f728f522a93632965437ea4"},"schema_version":"1.0","source":{"id":"1807.08684","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08684","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08684v3","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08684","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"pith_short_12","alias_value":"O6KBPGNA6SQY","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O6KBPGNA6SQYCZQX","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O6KBPGNA","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:8a3dff000bf298b06cd87c8e3ebc2f6a3f4c72ec5008de82ad39b1a300a415d5","target":"graph","created_at":"2026-05-18T00:06:11Z","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":"In this paper, a primal-dual gradient flow algorithm for distributed support vector machines (DSVM) is proposed. A network of computing nodes, each carrying a subset of horizontally partitioned large dataset is considered. The nodes are represented as dynamical systems with Arrow-Hurwicz-Uzawa gradient flow dynamics, derived from the Lagrangian function of the DSVM problem. It is first proved that the nodes are passive dynamical systems. Then, by employing the Krasovskii type candidate Lyapunov functions, it is proved that the computing nodes asymptotically converge to the optimal primal-dual ","authors_text":"Navdeep Singh, Prashant Bansode, Sushant Bahadure","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-07-23T15:49:07Z","title":"Primal-Dual Gradient Flow Algorithm for Distributed Support Vector Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08684","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:8e35a9e3c0c4d67c98a299b0a512d0601a7f63b2e21734c69f87945c7bd26b3e","target":"record","created_at":"2026-05-18T00:06:11Z","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":"13da7a16c368c82195d25e71b4c33348b1970f43e053e043a429c2867d50828a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-07-23T15:49:07Z","title_canon_sha256":"4a8eff342ba2f5c262ee3db067a51eb1e1db9d365f728f522a93632965437ea4"},"schema_version":"1.0","source":{"id":"1807.08684","kind":"arxiv","version":3}},"canonical_sha256":"77941799a0f4a181661726adabef4c4e358ce9a2390735316c787cec51e42039","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77941799a0f4a181661726adabef4c4e358ce9a2390735316c787cec51e42039","first_computed_at":"2026-05-18T00:06:11.209039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:11.209039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HZW5mZaM6fR8rSPrJqWhCBRNEdA5lWmXf3eeup6dvWe6cGmoglahdCQtpEKv/4y4RkHsG/mLvYCbC7Snkun/Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:11.209778Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.08684","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e35a9e3c0c4d67c98a299b0a512d0601a7f63b2e21734c69f87945c7bd26b3e","sha256:8a3dff000bf298b06cd87c8e3ebc2f6a3f4c72ec5008de82ad39b1a300a415d5"],"state_sha256":"cd9814f2a529b9bf53a5dfa5c717070099e3229602ef88c8a403c770dc1f1e22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CJvlE1o2YGoI+OoFBzAN4JeiobI+O2RYnyPfiLV3gnBrIDL+0ieRYT2aQVcWNW+8n8timzuynOdj7VlZ4X0MCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T17:18:55.116092Z","bundle_sha256":"9c96262cc481b4e75cf7670055fd7facaa4ea0b0a56c4b62ac649460a53cf02c"}}