{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XK2WQNP7JENCNPKGA5RHEQEGKN","short_pith_number":"pith:XK2WQNP7","schema_version":"1.0","canonical_sha256":"bab56835ff491a26bd46076272408653479347a1db74bdc5ae22e5f2fd25ddc6","source":{"kind":"arxiv","id":"2001.02112","version":2},"attestation_state":"computed","paper":{"title":"Multitask learning over graphs: An Approach for Distributed, Streaming Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA"],"primary_cat":"eess.SP","authors_text":"Ali H. Sayed, Cedric Richard, Jie Chen, Roula Nassif, Stefan Vlaski","submitted_at":"2020-01-07T15:32:57Z","abstract_excerpt":"The problem of learning simultaneously several related tasks has received considerable attention in several domains, especially in machine learning with the so-called multitask learning problem or learning to learn problem [1], [2]. Multitask learning is an approach to inductive transfer learning (using what is learned for one problem to assist in another problem) and helps improve generalization performance relative to learning each task separately by using the domain information contained in the training signals of related tasks as an inductive bias. Several strategies have been derived with"},"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":"2001.02112","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-01-07T15:32:57Z","cross_cats_sorted":["cs.LG","cs.MA"],"title_canon_sha256":"5a5986436753fbd7b8112b9c67dbf40db86f8ca6cd1e0728ce751c8d54d6ee4f","abstract_canon_sha256":"89d511e152ac97a9a0f67549a41813bb6ffb43e748058ad997f2643a30b6cf59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:18:12.633280Z","signature_b64":"rLe4Xp/ygQDAxsz89+9d+DsDwM5tDpeTjKxIuIS3KhIxwpCidq9vUcGbp9FaRid4Z1toTEwNbI9PQYskU9eZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bab56835ff491a26bd46076272408653479347a1db74bdc5ae22e5f2fd25ddc6","last_reissued_at":"2026-07-05T03:18:12.632788Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:18:12.632788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multitask learning over graphs: An Approach for Distributed, Streaming Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA"],"primary_cat":"eess.SP","authors_text":"Ali H. Sayed, Cedric Richard, Jie Chen, Roula Nassif, Stefan Vlaski","submitted_at":"2020-01-07T15:32:57Z","abstract_excerpt":"The problem of learning simultaneously several related tasks has received considerable attention in several domains, especially in machine learning with the so-called multitask learning problem or learning to learn problem [1], [2]. Multitask learning is an approach to inductive transfer learning (using what is learned for one problem to assist in another problem) and helps improve generalization performance relative to learning each task separately by using the domain information contained in the training signals of related tasks as an inductive bias. Several strategies have been derived with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.02112","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/2001.02112/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":"2001.02112","created_at":"2026-07-05T03:18:12.632847+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.02112v2","created_at":"2026-07-05T03:18:12.632847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.02112","created_at":"2026-07-05T03:18:12.632847+00:00"},{"alias_kind":"pith_short_12","alias_value":"XK2WQNP7JENC","created_at":"2026-07-05T03:18:12.632847+00:00"},{"alias_kind":"pith_short_16","alias_value":"XK2WQNP7JENCNPKG","created_at":"2026-07-05T03:18:12.632847+00:00"},{"alias_kind":"pith_short_8","alias_value":"XK2WQNP7","created_at":"2026-07-05T03:18:12.632847+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/XK2WQNP7JENCNPKGA5RHEQEGKN","json":"https://pith.science/pith/XK2WQNP7JENCNPKGA5RHEQEGKN.json","graph_json":"https://pith.science/api/pith-number/XK2WQNP7JENCNPKGA5RHEQEGKN/graph.json","events_json":"https://pith.science/api/pith-number/XK2WQNP7JENCNPKGA5RHEQEGKN/events.json","paper":"https://pith.science/paper/XK2WQNP7"},"agent_actions":{"view_html":"https://pith.science/pith/XK2WQNP7JENCNPKGA5RHEQEGKN","download_json":"https://pith.science/pith/XK2WQNP7JENCNPKGA5RHEQEGKN.json","view_paper":"https://pith.science/paper/XK2WQNP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.02112&json=true","fetch_graph":"https://pith.science/api/pith-number/XK2WQNP7JENCNPKGA5RHEQEGKN/graph.json","fetch_events":"https://pith.science/api/pith-number/XK2WQNP7JENCNPKGA5RHEQEGKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XK2WQNP7JENCNPKGA5RHEQEGKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XK2WQNP7JENCNPKGA5RHEQEGKN/action/storage_attestation","attest_author":"https://pith.science/pith/XK2WQNP7JENCNPKGA5RHEQEGKN/action/author_attestation","sign_citation":"https://pith.science/pith/XK2WQNP7JENCNPKGA5RHEQEGKN/action/citation_signature","submit_replication":"https://pith.science/pith/XK2WQNP7JENCNPKGA5RHEQEGKN/action/replication_record"}},"created_at":"2026-07-05T03:18:12.632847+00:00","updated_at":"2026-07-05T03:18:12.632847+00:00"}