{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PNUAZ7D4DGNMRWNCC5JVSZ4ITE","short_pith_number":"pith:PNUAZ7D4","schema_version":"1.0","canonical_sha256":"7b680cfc7c199ac8d9a21753596788991bb2f2281830c8d58fbad0db117dbc55","source":{"kind":"arxiv","id":"2303.15378","version":1},"attestation_state":"computed","paper":{"title":"CoDeC: Communication-Efficient Decentralized Continual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA"],"primary_cat":"cs.LG","authors_text":"Gobinda Saha, Kaushik Roy, Sai Aparna Aketi, Sakshi Choudhary","submitted_at":"2023-03-27T16:52:17Z","abstract_excerpt":"Training at the edge utilizes continuously evolving data generated at different locations. Privacy concerns prohibit the co-location of this spatially as well as temporally distributed data, deeming it crucial to design training algorithms that enable efficient continual learning over decentralized private data. Decentralized learning allows serverless training with spatially distributed data. A fundamental barrier in such distributed learning is the high bandwidth cost of communicating model updates between agents. Moreover, existing works under this training paradigm are not inherently suita"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2303.15378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-03-27T16:52:17Z","cross_cats_sorted":["cs.DC","cs.MA"],"title_canon_sha256":"895d42b47d6c3604b00d194d8a33468036c146d608d346fa63aa49cf25db37b7","abstract_canon_sha256":"42d0a0a9dbc805532ea8c3f69731beb4791d68e59a3c238e75a2022b2d8db0de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:55:04.384215Z","signature_b64":"3QrzZwuZe5IQ47JuWgRS/tzmFn4CLSB/d4xduLiTNvu27TBHxjOOKFDp1CzlrigkIys0b6kiGXymLqoumZ4pCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b680cfc7c199ac8d9a21753596788991bb2f2281830c8d58fbad0db117dbc55","last_reissued_at":"2026-07-05T05:55:04.383630Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:55:04.383630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CoDeC: Communication-Efficient Decentralized Continual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA"],"primary_cat":"cs.LG","authors_text":"Gobinda Saha, Kaushik Roy, Sai Aparna Aketi, Sakshi Choudhary","submitted_at":"2023-03-27T16:52:17Z","abstract_excerpt":"Training at the edge utilizes continuously evolving data generated at different locations. Privacy concerns prohibit the co-location of this spatially as well as temporally distributed data, deeming it crucial to design training algorithms that enable efficient continual learning over decentralized private data. Decentralized learning allows serverless training with spatially distributed data. A fundamental barrier in such distributed learning is the high bandwidth cost of communicating model updates between agents. Moreover, existing works under this training paradigm are not inherently suita"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.15378","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.15378/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2303.15378","created_at":"2026-07-05T05:55:04.383695+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.15378v1","created_at":"2026-07-05T05:55:04.383695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.15378","created_at":"2026-07-05T05:55:04.383695+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNUAZ7D4DGNM","created_at":"2026-07-05T05:55:04.383695+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNUAZ7D4DGNMRWNC","created_at":"2026-07-05T05:55:04.383695+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNUAZ7D4","created_at":"2026-07-05T05:55:04.383695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2601.22274","citing_title":"Server-Proximal Aggregation for Federated Domain-Incremental Learning under Partial Participation: Task-Uniform Convergence and Backward Transfer","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PNUAZ7D4DGNMRWNCC5JVSZ4ITE","json":"https://pith.science/pith/PNUAZ7D4DGNMRWNCC5JVSZ4ITE.json","graph_json":"https://pith.science/api/pith-number/PNUAZ7D4DGNMRWNCC5JVSZ4ITE/graph.json","events_json":"https://pith.science/api/pith-number/PNUAZ7D4DGNMRWNCC5JVSZ4ITE/events.json","paper":"https://pith.science/paper/PNUAZ7D4"},"agent_actions":{"view_html":"https://pith.science/pith/PNUAZ7D4DGNMRWNCC5JVSZ4ITE","download_json":"https://pith.science/pith/PNUAZ7D4DGNMRWNCC5JVSZ4ITE.json","view_paper":"https://pith.science/paper/PNUAZ7D4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.15378&json=true","fetch_graph":"https://pith.science/api/pith-number/PNUAZ7D4DGNMRWNCC5JVSZ4ITE/graph.json","fetch_events":"https://pith.science/api/pith-number/PNUAZ7D4DGNMRWNCC5JVSZ4ITE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNUAZ7D4DGNMRWNCC5JVSZ4ITE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNUAZ7D4DGNMRWNCC5JVSZ4ITE/action/storage_attestation","attest_author":"https://pith.science/pith/PNUAZ7D4DGNMRWNCC5JVSZ4ITE/action/author_attestation","sign_citation":"https://pith.science/pith/PNUAZ7D4DGNMRWNCC5JVSZ4ITE/action/citation_signature","submit_replication":"https://pith.science/pith/PNUAZ7D4DGNMRWNCC5JVSZ4ITE/action/replication_record"}},"created_at":"2026-07-05T05:55:04.383695+00:00","updated_at":"2026-07-05T05:55:04.383695+00:00"}