{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WCVEESRT65F3NTT5BUF5IZ67YQ","short_pith_number":"pith:WCVEESRT","canonical_record":{"source":{"id":"1606.02421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-08T07:01:47Z","cross_cats_sorted":["cs.AI","cs.DC","cs.LG","cs.SY"],"title_canon_sha256":"7685c777c0f7593aa4cafed338ba8746a2562c5413b1aacda4a77be97fe4ba96","abstract_canon_sha256":"67d484305cce2cffab9eef46080da1447d30bdf1904c43803811575a3c182e7d"},"schema_version":"1.0"},"canonical_sha256":"b0aa424a33f74bb6ce7d0d0bd467dfc406cd790a6f65aeb256140702b00c4486","source":{"kind":"arxiv","id":"1606.02421","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02421","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02421v1","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02421","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"WCVEESRT65F3","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WCVEESRT65F3NTT5","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WCVEESRT","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WCVEESRT65F3NTT5BUF5IZ67YQ","target":"record","payload":{"canonical_record":{"source":{"id":"1606.02421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-08T07:01:47Z","cross_cats_sorted":["cs.AI","cs.DC","cs.LG","cs.SY"],"title_canon_sha256":"7685c777c0f7593aa4cafed338ba8746a2562c5413b1aacda4a77be97fe4ba96","abstract_canon_sha256":"67d484305cce2cffab9eef46080da1447d30bdf1904c43803811575a3c182e7d"},"schema_version":"1.0"},"canonical_sha256":"b0aa424a33f74bb6ce7d0d0bd467dfc406cd790a6f65aeb256140702b00c4486","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:39.108157Z","signature_b64":"oh5QcePOenWJGF2jn2+Sys2dWzJKznHk6pgzRhHiJn9YCUnwFWCCTAfqIjCs/NU6eESBMm2I0y3omdRk1bhuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0aa424a33f74bb6ce7d0d0bd467dfc406cd790a6f65aeb256140702b00c4486","last_reissued_at":"2026-05-17T23:55:39.107688Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:39.107688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.02421","source_version":1,"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-17T23:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"94TVMrFHy1iMi7a8aJoKhQ4N5tTC0Z1KLi+3/tszomwgswPnanfYkXHHUWm5LZHZ09TZ8XnBC1jRszmVYMb8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:32:14.155225Z"},"content_sha256":"33520b842f3833d77dfa469c834908dea5445d56dfdff6c21f499f5f788d7993","schema_version":"1.0","event_id":"sha256:33520b842f3833d77dfa469c834908dea5445d56dfdff6c21f499f5f788d7993"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WCVEESRT65F3NTT5BUF5IZ67YQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gossip Dual Averaging for Decentralized Optimization of Pairwise Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DC","cs.LG","cs.SY"],"primary_cat":"stat.ML","authors_text":"Aur\\'elien Bellet, Igor Colin, Joseph Salmon, St\\'ephan Cl\\'emen\\c{c}on","submitted_at":"2016-06-08T07:01:47Z","abstract_excerpt":"In decentralized networks (of sensors, connected objects, etc.), there is an important need for efficient algorithms to optimize a global cost function, for instance to learn a global model from the local data collected by each computing unit. In this paper, we address the problem of decentralized minimization of pairwise functions of the data points, where these points are distributed over the nodes of a graph defining the communication topology of the network. This general problem finds applications in ranking, distance metric learning and graph inference, among others. We propose new gossip"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02421","kind":"arxiv","version":1},"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-17T23:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FBibX9NnCRq65RDbiXb8ZYkYzWVAYAJkBDWLi+8z8efVwOE49MP4sHp1sl/HymPBFcna6So3xUbWsUGOSCVvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:32:14.155623Z"},"content_sha256":"c276de9548b71f98cea41ab2c70fbbe944b68e6a31fda5b4491c080a2784b317","schema_version":"1.0","event_id":"sha256:c276de9548b71f98cea41ab2c70fbbe944b68e6a31fda5b4491c080a2784b317"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WCVEESRT65F3NTT5BUF5IZ67YQ/bundle.json","state_url":"https://pith.science/pith/WCVEESRT65F3NTT5BUF5IZ67YQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WCVEESRT65F3NTT5BUF5IZ67YQ/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-01T11:32:14Z","links":{"resolver":"https://pith.science/pith/WCVEESRT65F3NTT5BUF5IZ67YQ","bundle":"https://pith.science/pith/WCVEESRT65F3NTT5BUF5IZ67YQ/bundle.json","state":"https://pith.science/pith/WCVEESRT65F3NTT5BUF5IZ67YQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WCVEESRT65F3NTT5BUF5IZ67YQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WCVEESRT65F3NTT5BUF5IZ67YQ","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":"67d484305cce2cffab9eef46080da1447d30bdf1904c43803811575a3c182e7d","cross_cats_sorted":["cs.AI","cs.DC","cs.LG","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-08T07:01:47Z","title_canon_sha256":"7685c777c0f7593aa4cafed338ba8746a2562c5413b1aacda4a77be97fe4ba96"},"schema_version":"1.0","source":{"id":"1606.02421","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02421","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02421v1","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02421","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"WCVEESRT65F3","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WCVEESRT65F3NTT5","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WCVEESRT","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:c276de9548b71f98cea41ab2c70fbbe944b68e6a31fda5b4491c080a2784b317","target":"graph","created_at":"2026-05-17T23:55:39Z","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 decentralized networks (of sensors, connected objects, etc.), there is an important need for efficient algorithms to optimize a global cost function, for instance to learn a global model from the local data collected by each computing unit. In this paper, we address the problem of decentralized minimization of pairwise functions of the data points, where these points are distributed over the nodes of a graph defining the communication topology of the network. This general problem finds applications in ranking, distance metric learning and graph inference, among others. We propose new gossip","authors_text":"Aur\\'elien Bellet, Igor Colin, Joseph Salmon, St\\'ephan Cl\\'emen\\c{c}on","cross_cats":["cs.AI","cs.DC","cs.LG","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-08T07:01:47Z","title":"Gossip Dual Averaging for Decentralized Optimization of Pairwise Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02421","kind":"arxiv","version":1},"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:33520b842f3833d77dfa469c834908dea5445d56dfdff6c21f499f5f788d7993","target":"record","created_at":"2026-05-17T23:55:39Z","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":"67d484305cce2cffab9eef46080da1447d30bdf1904c43803811575a3c182e7d","cross_cats_sorted":["cs.AI","cs.DC","cs.LG","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-08T07:01:47Z","title_canon_sha256":"7685c777c0f7593aa4cafed338ba8746a2562c5413b1aacda4a77be97fe4ba96"},"schema_version":"1.0","source":{"id":"1606.02421","kind":"arxiv","version":1}},"canonical_sha256":"b0aa424a33f74bb6ce7d0d0bd467dfc406cd790a6f65aeb256140702b00c4486","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0aa424a33f74bb6ce7d0d0bd467dfc406cd790a6f65aeb256140702b00c4486","first_computed_at":"2026-05-17T23:55:39.107688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:39.107688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oh5QcePOenWJGF2jn2+Sys2dWzJKznHk6pgzRhHiJn9YCUnwFWCCTAfqIjCs/NU6eESBMm2I0y3omdRk1bhuCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:39.108157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.02421","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33520b842f3833d77dfa469c834908dea5445d56dfdff6c21f499f5f788d7993","sha256:c276de9548b71f98cea41ab2c70fbbe944b68e6a31fda5b4491c080a2784b317"],"state_sha256":"835b3ad01f8bb3ccaca7488e53a68745a2f3d9d465bed6c5070f28b4f9607bd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pCpWSAFVYFLHO2+xgQSskvnAoQLvZWFCtHuDDeNgoP7JSjT24nJCstmi9OitP1fxSh5Wc/hbP+vM/7dfjX+zCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:32:14.157754Z","bundle_sha256":"0d313e35c165a5380fc7725f53e12fb0c02cd5461677685c45b1ff29a1a5e3c2"}}