{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XIYM2DTVF5ECWDMC77YY4HQEYY","short_pith_number":"pith:XIYM2DTV","schema_version":"1.0","canonical_sha256":"ba30cd0e752f482b0d82fff18e1e04c61a1010d88af99d866de81ed5b5906226","source":{"kind":"arxiv","id":"1808.05933","version":2},"attestation_state":"computed","paper":{"title":"Decentralized Dictionary Learning Over Time-Varying Digraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"math.OC","authors_text":"Amir Daneshmand, Brian M. Sadler, Francisco Facchinei, Gesualdo Scutari, Ying Sun","submitted_at":"2018-08-17T17:20:06Z","abstract_excerpt":"This paper studies Dictionary Learning problems wherein the learning task is distributed over a multi-agent network, modeled as a time-varying directed graph. This formulation is relevant, for instance, in Big Data scenarios where massive amounts of data are collected/stored in different locations (e.g., sensors, clouds) and aggregating and/or processing all data in a fusion center might be inefficient or unfeasible, due to resource limitations, communication overheads or privacy issues. We develop a unified decentralized algorithmic framework for this class of nonconvex problems, which is pro"},"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":"1808.05933","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-08-17T17:20:06Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"566724c249beee501c35b54a5dde703d7304e62f6178e7d483be87b4cbb2b738","abstract_canon_sha256":"71271bfc6a20653ef5f2e2db558ee653d5c9229b507816716ffb766f1bbcb775"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:05.471898Z","signature_b64":"ac2/eRlIO2Lyb68rYnTtAjD1eQV9ozeGhHev7Lw5qDa4vWf3JnKytwGo31/mdn4woC5qjEy52vQ8abR5z9bECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba30cd0e752f482b0d82fff18e1e04c61a1010d88af99d866de81ed5b5906226","last_reissued_at":"2026-05-17T23:52:05.471399Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:05.471399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized Dictionary Learning Over Time-Varying Digraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"math.OC","authors_text":"Amir Daneshmand, Brian M. Sadler, Francisco Facchinei, Gesualdo Scutari, Ying Sun","submitted_at":"2018-08-17T17:20:06Z","abstract_excerpt":"This paper studies Dictionary Learning problems wherein the learning task is distributed over a multi-agent network, modeled as a time-varying directed graph. This formulation is relevant, for instance, in Big Data scenarios where massive amounts of data are collected/stored in different locations (e.g., sensors, clouds) and aggregating and/or processing all data in a fusion center might be inefficient or unfeasible, due to resource limitations, communication overheads or privacy issues. We develop a unified decentralized algorithmic framework for this class of nonconvex problems, which is pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05933","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.05933","created_at":"2026-05-17T23:52:05.471474+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.05933v2","created_at":"2026-05-17T23:52:05.471474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05933","created_at":"2026-05-17T23:52:05.471474+00:00"},{"alias_kind":"pith_short_12","alias_value":"XIYM2DTVF5EC","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XIYM2DTVF5ECWDMC","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XIYM2DTV","created_at":"2026-05-18T12:33:01.666342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XIYM2DTVF5ECWDMC77YY4HQEYY","json":"https://pith.science/pith/XIYM2DTVF5ECWDMC77YY4HQEYY.json","graph_json":"https://pith.science/api/pith-number/XIYM2DTVF5ECWDMC77YY4HQEYY/graph.json","events_json":"https://pith.science/api/pith-number/XIYM2DTVF5ECWDMC77YY4HQEYY/events.json","paper":"https://pith.science/paper/XIYM2DTV"},"agent_actions":{"view_html":"https://pith.science/pith/XIYM2DTVF5ECWDMC77YY4HQEYY","download_json":"https://pith.science/pith/XIYM2DTVF5ECWDMC77YY4HQEYY.json","view_paper":"https://pith.science/paper/XIYM2DTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.05933&json=true","fetch_graph":"https://pith.science/api/pith-number/XIYM2DTVF5ECWDMC77YY4HQEYY/graph.json","fetch_events":"https://pith.science/api/pith-number/XIYM2DTVF5ECWDMC77YY4HQEYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XIYM2DTVF5ECWDMC77YY4HQEYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XIYM2DTVF5ECWDMC77YY4HQEYY/action/storage_attestation","attest_author":"https://pith.science/pith/XIYM2DTVF5ECWDMC77YY4HQEYY/action/author_attestation","sign_citation":"https://pith.science/pith/XIYM2DTVF5ECWDMC77YY4HQEYY/action/citation_signature","submit_replication":"https://pith.science/pith/XIYM2DTVF5ECWDMC77YY4HQEYY/action/replication_record"}},"created_at":"2026-05-17T23:52:05.471474+00:00","updated_at":"2026-05-17T23:52:05.471474+00:00"}