{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:E4MZ7CV6EX2LYNZAU3YVCHETLS","short_pith_number":"pith:E4MZ7CV6","schema_version":"1.0","canonical_sha256":"27199f8abe25f4bc3720a6f1511c935cb210db9eec868ba2470de26ab9a33f68","source":{"kind":"arxiv","id":"1603.02185","version":1},"attestation_state":"computed","paper":{"title":"Distributed Multi-Task Learning with Shared Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jialei Wang, Mladen Kolar, Nathan Srebro","submitted_at":"2016-03-07T18:11:54Z","abstract_excerpt":"We study the problem of distributed multi-task learning with shared representation, where each machine aims to learn a separate, but related, task in an unknown shared low-dimensional subspaces, i.e. when the predictor matrix has low rank. We consider a setting where each task is handled by a different machine, with samples for the task available locally on the machine, and study communication-efficient methods for exploiting the shared structure."},"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":"1603.02185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-07T18:11:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f3264963be1002120eddbb393bd5f329b2f579c51671202290e13181ec0fcbc9","abstract_canon_sha256":"02b713ab2b0fa75527d6d4dbb031e34bff729f018cea272248e7e406c98b0723"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:31.413020Z","signature_b64":"hkAMGBXYZ54VKnazDfb+CiISL4j+f/frPHaU4cDsAdGZEkAW0r+WYO8holUug7yJA+VPgjbh84cqohNLfrZeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27199f8abe25f4bc3720a6f1511c935cb210db9eec868ba2470de26ab9a33f68","last_reissued_at":"2026-05-18T01:19:31.412570Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:31.412570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Multi-Task Learning with Shared Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jialei Wang, Mladen Kolar, Nathan Srebro","submitted_at":"2016-03-07T18:11:54Z","abstract_excerpt":"We study the problem of distributed multi-task learning with shared representation, where each machine aims to learn a separate, but related, task in an unknown shared low-dimensional subspaces, i.e. when the predictor matrix has low rank. We consider a setting where each task is handled by a different machine, with samples for the task available locally on the machine, and study communication-efficient methods for exploiting the shared structure."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02185","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.02185","created_at":"2026-05-18T01:19:31.412631+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.02185v1","created_at":"2026-05-18T01:19:31.412631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02185","created_at":"2026-05-18T01:19:31.412631+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4MZ7CV6EX2L","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4MZ7CV6EX2LYNZA","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4MZ7CV6","created_at":"2026-05-18T12:30:12.583610+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/E4MZ7CV6EX2LYNZAU3YVCHETLS","json":"https://pith.science/pith/E4MZ7CV6EX2LYNZAU3YVCHETLS.json","graph_json":"https://pith.science/api/pith-number/E4MZ7CV6EX2LYNZAU3YVCHETLS/graph.json","events_json":"https://pith.science/api/pith-number/E4MZ7CV6EX2LYNZAU3YVCHETLS/events.json","paper":"https://pith.science/paper/E4MZ7CV6"},"agent_actions":{"view_html":"https://pith.science/pith/E4MZ7CV6EX2LYNZAU3YVCHETLS","download_json":"https://pith.science/pith/E4MZ7CV6EX2LYNZAU3YVCHETLS.json","view_paper":"https://pith.science/paper/E4MZ7CV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.02185&json=true","fetch_graph":"https://pith.science/api/pith-number/E4MZ7CV6EX2LYNZAU3YVCHETLS/graph.json","fetch_events":"https://pith.science/api/pith-number/E4MZ7CV6EX2LYNZAU3YVCHETLS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4MZ7CV6EX2LYNZAU3YVCHETLS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4MZ7CV6EX2LYNZAU3YVCHETLS/action/storage_attestation","attest_author":"https://pith.science/pith/E4MZ7CV6EX2LYNZAU3YVCHETLS/action/author_attestation","sign_citation":"https://pith.science/pith/E4MZ7CV6EX2LYNZAU3YVCHETLS/action/citation_signature","submit_replication":"https://pith.science/pith/E4MZ7CV6EX2LYNZAU3YVCHETLS/action/replication_record"}},"created_at":"2026-05-18T01:19:31.412631+00:00","updated_at":"2026-05-18T01:19:31.412631+00:00"}