{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CR4PR6U2EYUDFY4QWU54SU5BH7","short_pith_number":"pith:CR4PR6U2","canonical_record":{"source":{"id":"1803.09737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-26T17:53:56Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"d0ea11af27d931460af045a181716c7918624d695d3e5be488f8d84e24161bdb","abstract_canon_sha256":"46684e7055756899a9757e8ec8efdb5059227c9e6c1645cb054266609ffc49e6"},"schema_version":"1.0"},"canonical_sha256":"1478f8fa9a262832e390b53bc953a13ff0d8eafd23801aa4cff35907523be9fa","source":{"kind":"arxiv","id":"1803.09737","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09737","created_at":"2026-05-18T00:07:08Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09737v2","created_at":"2026-05-18T00:07:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09737","created_at":"2026-05-18T00:07:08Z"},{"alias_kind":"pith_short_12","alias_value":"CR4PR6U2EYUD","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CR4PR6U2EYUDFY4Q","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CR4PR6U2","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CR4PR6U2EYUDFY4QWU54SU5BH7","target":"record","payload":{"canonical_record":{"source":{"id":"1803.09737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-26T17:53:56Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"d0ea11af27d931460af045a181716c7918624d695d3e5be488f8d84e24161bdb","abstract_canon_sha256":"46684e7055756899a9757e8ec8efdb5059227c9e6c1645cb054266609ffc49e6"},"schema_version":"1.0"},"canonical_sha256":"1478f8fa9a262832e390b53bc953a13ff0d8eafd23801aa4cff35907523be9fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:08.138561Z","signature_b64":"QPOl0NPkSW/D94IClCGvqCtNSMY4OfH2vYHQaaLcpt6iQxnXNNfW6X058g1IuQ/TbSYt3lZ0aSrQHi7dCZ0ADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1478f8fa9a262832e390b53bc953a13ff0d8eafd23801aa4cff35907523be9fa","last_reissued_at":"2026-05-18T00:07:08.137780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:08.137780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.09737","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:07:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wDFErkCR9CzAsR4dK4chwg+9JcOeR9lNJ1OobuRtc7erFH4OYGOs1GcxKQ1A1CxvFwUgjALcEvhRNuOM20FkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:54:31.080265Z"},"content_sha256":"ebb9b57f7a9704a17351df3d653aeb5a908a5f0a2e5f624f66a31fe5b5a94296","schema_version":"1.0","event_id":"sha256:ebb9b57f7a9704a17351df3d653aeb5a908a5f0a2e5f624f66a31fe5b5a94296"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CR4PR6U2EYUDFY4QWU54SU5BH7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DJAM: distributed Jacobi asynchronous method for learning personal models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"In\\^es Almeida, Jo\\~ao Xavier","submitted_at":"2018-03-26T17:53:56Z","abstract_excerpt":"Processing data collected by a network of agents often boils down to solving an optimization problem. The distributed nature of these problems calls for methods that are, themselves, distributed. While most collaborative learning problems require agents to reach a common (or consensus) model, there are situations in which the consensus solution may not be optimal. For instance, agents may want to reach a compromise between agreeing with their neighbors and minimizing a personal loss function. We present DJAM, a Jacobi-like distributed algorithm for learning personalized models. This method is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09737","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:07:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EbvsChhAuY6Vkqxj4DlWIlgXzbcSJUbyq3VpDYH5HFpLRTVre1fRBEftLt9Juzb5HBrahufzd2RcIyTm9EbRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:54:31.080952Z"},"content_sha256":"e0bed74289bdf6c7ad186f42892974ff9a336497f15ed7fe9a92d9bfa2d52186","schema_version":"1.0","event_id":"sha256:e0bed74289bdf6c7ad186f42892974ff9a336497f15ed7fe9a92d9bfa2d52186"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CR4PR6U2EYUDFY4QWU54SU5BH7/bundle.json","state_url":"https://pith.science/pith/CR4PR6U2EYUDFY4QWU54SU5BH7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CR4PR6U2EYUDFY4QWU54SU5BH7/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-08T01:54:31Z","links":{"resolver":"https://pith.science/pith/CR4PR6U2EYUDFY4QWU54SU5BH7","bundle":"https://pith.science/pith/CR4PR6U2EYUDFY4QWU54SU5BH7/bundle.json","state":"https://pith.science/pith/CR4PR6U2EYUDFY4QWU54SU5BH7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CR4PR6U2EYUDFY4QWU54SU5BH7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CR4PR6U2EYUDFY4QWU54SU5BH7","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":"46684e7055756899a9757e8ec8efdb5059227c9e6c1645cb054266609ffc49e6","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-26T17:53:56Z","title_canon_sha256":"d0ea11af27d931460af045a181716c7918624d695d3e5be488f8d84e24161bdb"},"schema_version":"1.0","source":{"id":"1803.09737","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09737","created_at":"2026-05-18T00:07:08Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09737v2","created_at":"2026-05-18T00:07:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09737","created_at":"2026-05-18T00:07:08Z"},{"alias_kind":"pith_short_12","alias_value":"CR4PR6U2EYUD","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CR4PR6U2EYUDFY4Q","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CR4PR6U2","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:e0bed74289bdf6c7ad186f42892974ff9a336497f15ed7fe9a92d9bfa2d52186","target":"graph","created_at":"2026-05-18T00:07:08Z","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":"Processing data collected by a network of agents often boils down to solving an optimization problem. The distributed nature of these problems calls for methods that are, themselves, distributed. While most collaborative learning problems require agents to reach a common (or consensus) model, there are situations in which the consensus solution may not be optimal. For instance, agents may want to reach a compromise between agreeing with their neighbors and minimizing a personal loss function. We present DJAM, a Jacobi-like distributed algorithm for learning personalized models. This method is ","authors_text":"In\\^es Almeida, Jo\\~ao Xavier","cross_cats":["cs.DC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-26T17:53:56Z","title":"DJAM: distributed Jacobi asynchronous method for learning personal models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09737","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:ebb9b57f7a9704a17351df3d653aeb5a908a5f0a2e5f624f66a31fe5b5a94296","target":"record","created_at":"2026-05-18T00:07:08Z","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":"46684e7055756899a9757e8ec8efdb5059227c9e6c1645cb054266609ffc49e6","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-26T17:53:56Z","title_canon_sha256":"d0ea11af27d931460af045a181716c7918624d695d3e5be488f8d84e24161bdb"},"schema_version":"1.0","source":{"id":"1803.09737","kind":"arxiv","version":2}},"canonical_sha256":"1478f8fa9a262832e390b53bc953a13ff0d8eafd23801aa4cff35907523be9fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1478f8fa9a262832e390b53bc953a13ff0d8eafd23801aa4cff35907523be9fa","first_computed_at":"2026-05-18T00:07:08.137780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:08.137780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QPOl0NPkSW/D94IClCGvqCtNSMY4OfH2vYHQaaLcpt6iQxnXNNfW6X058g1IuQ/TbSYt3lZ0aSrQHi7dCZ0ADA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:08.138561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09737","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebb9b57f7a9704a17351df3d653aeb5a908a5f0a2e5f624f66a31fe5b5a94296","sha256:e0bed74289bdf6c7ad186f42892974ff9a336497f15ed7fe9a92d9bfa2d52186"],"state_sha256":"611cc303e7ee39838a43a2143d6885451214cdf66e0dfa83382fa479edcf2861"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ZbaSzxV/ioUyDT0Hg4vASjEnIfrfluD9cZWC+wT+eTJzvlhcFY+gZ3Gxp19E7X5MhjN34NGT3+AS38SQe8ECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:54:31.084974Z","bundle_sha256":"ac47e6629253334a2c66330fc24f46b31b43949ff3973f89fcb8178a2db032c9"}}