{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:7M7QYBOVIZLDFYUL4SJUDXVOCL","short_pith_number":"pith:7M7QYBOV","canonical_record":{"source":{"id":"2208.13810","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-08-29T18:01:42Z","cross_cats_sorted":[],"title_canon_sha256":"388b6a8534a9db0d02d590490729196a88e5e8e3361425b2609dbaa93cdf9afd","abstract_canon_sha256":"47c688f054419171fd3b595db2c3fd124a0f07eec3b300452170d496ff0e57ce"},"schema_version":"1.0"},"canonical_sha256":"fb3f0c05d5465632e28be49341deae12fee48a20072e43366fa4ff365c5a5652","source":{"kind":"arxiv","id":"2208.13810","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.13810","created_at":"2026-07-05T04:56:20Z"},{"alias_kind":"arxiv_version","alias_value":"2208.13810v2","created_at":"2026-07-05T04:56:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.13810","created_at":"2026-07-05T04:56:20Z"},{"alias_kind":"pith_short_12","alias_value":"7M7QYBOVIZLD","created_at":"2026-07-05T04:56:20Z"},{"alias_kind":"pith_short_16","alias_value":"7M7QYBOVIZLDFYUL","created_at":"2026-07-05T04:56:20Z"},{"alias_kind":"pith_short_8","alias_value":"7M7QYBOV","created_at":"2026-07-05T04:56:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:7M7QYBOVIZLDFYUL4SJUDXVOCL","target":"record","payload":{"canonical_record":{"source":{"id":"2208.13810","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-08-29T18:01:42Z","cross_cats_sorted":[],"title_canon_sha256":"388b6a8534a9db0d02d590490729196a88e5e8e3361425b2609dbaa93cdf9afd","abstract_canon_sha256":"47c688f054419171fd3b595db2c3fd124a0f07eec3b300452170d496ff0e57ce"},"schema_version":"1.0"},"canonical_sha256":"fb3f0c05d5465632e28be49341deae12fee48a20072e43366fa4ff365c5a5652","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:56:20.550152Z","signature_b64":"vFkRLlhlD25mZl2irJQFIvn/6wfkcTfI8Pf4mY/j15VLK/MyGg+/t1aBXEOfG1P/VRSd9XsOuemh2vrIsq5aAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb3f0c05d5465632e28be49341deae12fee48a20072e43366fa4ff365c5a5652","last_reissued_at":"2026-07-05T04:56:20.549746Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:56:20.549746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.13810","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-07-05T04:56:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wsHvW9G4WwNVfXYmOKrTcCy8BJ38Tdyfkrkeq7oRtlKZtw4qsO9UfNYIfQcH7RZlpgy8r3879pjtH/Li6BaCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:19:09.495971Z"},"content_sha256":"bb24248351056b2c48599ad852d71e07e84f6e4ba6627bd7517400692c769c6d","schema_version":"1.0","event_id":"sha256:bb24248351056b2c48599ad852d71e07e84f6e4ba6627bd7517400692c769c6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:7M7QYBOVIZLDFYUL4SJUDXVOCL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DR-DSGD: A Distributionally Robust Decentralized Learning Algorithm over Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anis Elgabli, Chaouki Ben Issaid, Mehdi Bennis","submitted_at":"2022-08-29T18:01:42Z","abstract_excerpt":"In this paper, we propose to solve a regularized distributionally robust learning problem in the decentralized setting, taking into account the data distribution shift. By adding a Kullback-Liebler regularization function to the robust min-max optimization problem, the learning problem can be reduced to a modified robust minimization problem and solved efficiently. Leveraging the newly formulated optimization problem, we propose a robust version of Decentralized Stochastic Gradient Descent (DSGD), coined Distributionally Robust Decentralized Stochastic Gradient Descent (DR-DSGD). Under some mi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.13810","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.13810/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:56:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0yGsUmTRJDdcn2M4XxNKMh5M64asCqp1JtRZLwlJdP/NOU5SpmQhmuB7Rz0CpBpdvEOaeKAFHP1zEBNoWA/HBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:19:09.496904Z"},"content_sha256":"7228c7c2e7f1d0609498b7a270c9b9e1e97ca4583fcec8e9b984c7ba391b2308","schema_version":"1.0","event_id":"sha256:7228c7c2e7f1d0609498b7a270c9b9e1e97ca4583fcec8e9b984c7ba391b2308"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7M7QYBOVIZLDFYUL4SJUDXVOCL/bundle.json","state_url":"https://pith.science/pith/7M7QYBOVIZLDFYUL4SJUDXVOCL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7M7QYBOVIZLDFYUL4SJUDXVOCL/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-08-11T02:19:09Z","links":{"resolver":"https://pith.science/pith/7M7QYBOVIZLDFYUL4SJUDXVOCL","bundle":"https://pith.science/pith/7M7QYBOVIZLDFYUL4SJUDXVOCL/bundle.json","state":"https://pith.science/pith/7M7QYBOVIZLDFYUL4SJUDXVOCL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7M7QYBOVIZLDFYUL4SJUDXVOCL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:7M7QYBOVIZLDFYUL4SJUDXVOCL","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":"47c688f054419171fd3b595db2c3fd124a0f07eec3b300452170d496ff0e57ce","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-08-29T18:01:42Z","title_canon_sha256":"388b6a8534a9db0d02d590490729196a88e5e8e3361425b2609dbaa93cdf9afd"},"schema_version":"1.0","source":{"id":"2208.13810","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.13810","created_at":"2026-07-05T04:56:20Z"},{"alias_kind":"arxiv_version","alias_value":"2208.13810v2","created_at":"2026-07-05T04:56:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.13810","created_at":"2026-07-05T04:56:20Z"},{"alias_kind":"pith_short_12","alias_value":"7M7QYBOVIZLD","created_at":"2026-07-05T04:56:20Z"},{"alias_kind":"pith_short_16","alias_value":"7M7QYBOVIZLDFYUL","created_at":"2026-07-05T04:56:20Z"},{"alias_kind":"pith_short_8","alias_value":"7M7QYBOV","created_at":"2026-07-05T04:56:20Z"}],"graph_snapshots":[{"event_id":"sha256:7228c7c2e7f1d0609498b7a270c9b9e1e97ca4583fcec8e9b984c7ba391b2308","target":"graph","created_at":"2026-07-05T04:56:20Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2208.13810/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose to solve a regularized distributionally robust learning problem in the decentralized setting, taking into account the data distribution shift. By adding a Kullback-Liebler regularization function to the robust min-max optimization problem, the learning problem can be reduced to a modified robust minimization problem and solved efficiently. Leveraging the newly formulated optimization problem, we propose a robust version of Decentralized Stochastic Gradient Descent (DSGD), coined Distributionally Robust Decentralized Stochastic Gradient Descent (DR-DSGD). Under some mi","authors_text":"Anis Elgabli, Chaouki Ben Issaid, Mehdi Bennis","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-08-29T18:01:42Z","title":"DR-DSGD: A Distributionally Robust Decentralized Learning Algorithm over Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.13810","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:bb24248351056b2c48599ad852d71e07e84f6e4ba6627bd7517400692c769c6d","target":"record","created_at":"2026-07-05T04:56:20Z","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":"47c688f054419171fd3b595db2c3fd124a0f07eec3b300452170d496ff0e57ce","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-08-29T18:01:42Z","title_canon_sha256":"388b6a8534a9db0d02d590490729196a88e5e8e3361425b2609dbaa93cdf9afd"},"schema_version":"1.0","source":{"id":"2208.13810","kind":"arxiv","version":2}},"canonical_sha256":"fb3f0c05d5465632e28be49341deae12fee48a20072e43366fa4ff365c5a5652","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb3f0c05d5465632e28be49341deae12fee48a20072e43366fa4ff365c5a5652","first_computed_at":"2026-07-05T04:56:20.549746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:56:20.549746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vFkRLlhlD25mZl2irJQFIvn/6wfkcTfI8Pf4mY/j15VLK/MyGg+/t1aBXEOfG1P/VRSd9XsOuemh2vrIsq5aAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:56:20.550152Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.13810","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb24248351056b2c48599ad852d71e07e84f6e4ba6627bd7517400692c769c6d","sha256:7228c7c2e7f1d0609498b7a270c9b9e1e97ca4583fcec8e9b984c7ba391b2308"],"state_sha256":"2b6d6365858ab730c835c3dbc32a9c8d470e855d0d47de50edc574e93967a597"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bp0SaZ/D95aj0M18dUSI8oSISYZ7AHdXM7vdpRZL5xtVUceEH+JpLsq+NhQdjJXry2UxQ4jL8fx8C9sdbMyqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T02:19:09.511389Z","bundle_sha256":"d89ad2e3af5df001dafa5735b2986afce37ace6f06dffbcc90606c1faef80416"}}