{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JRRSJIXOEHMNN2AGSM4VM3TWGG","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":"451b830f7819ef54598c3de98a573824cd107295077d1dbd3ef0625753d5e1d5","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-21T18:07:02Z","title_canon_sha256":"389d3c598c18f1ab7126e32697ff115cfd4716623ff98d34a529cb29ceaee19b"},"schema_version":"1.0","source":{"id":"1903.09171","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09171","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09171v1","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09171","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"pith_short_12","alias_value":"JRRSJIXOEHMN","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JRRSJIXOEHMNN2AG","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JRRSJIXO","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:eba158dc1a3b0ffa162ebf70f2a89e62ac5b78771780dcfdf632f27265db810c","target":"graph","created_at":"2026-05-17T23:50:40Z","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":"Multi-task learning, as it is understood nowadays, consists of using one single model to carry out several similar tasks. From classifying hand-written characters of different alphabets to figuring out how to play several Atari games using reinforcement learning, multi-task models have been able to widen their performance range across different tasks, although these tasks are usually of a similar nature. In this work, we attempt to widen this range even further, by including heterogeneous tasks in a single learning procedure. To do so, we firstly formally define a multi-network model, identify","authors_text":"Alexander Mendiburu, Roberto Santana, Unai Garciarena","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-21T18:07:02Z","title":"Towards automatic construction of multi-network models for heterogeneous multi-task learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09171","kind":"arxiv","version":1},"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:28331efac7e6d7b48fdaf0c22c21ee8914c6d93606432ea775dd70b091f9e9e6","target":"record","created_at":"2026-05-17T23:50:40Z","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":"451b830f7819ef54598c3de98a573824cd107295077d1dbd3ef0625753d5e1d5","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-21T18:07:02Z","title_canon_sha256":"389d3c598c18f1ab7126e32697ff115cfd4716623ff98d34a529cb29ceaee19b"},"schema_version":"1.0","source":{"id":"1903.09171","kind":"arxiv","version":1}},"canonical_sha256":"4c6324a2ee21d8d6e8069339566e7631ab71fd1ff80e489364eebca94b71530d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c6324a2ee21d8d6e8069339566e7631ab71fd1ff80e489364eebca94b71530d","first_computed_at":"2026-05-17T23:50:40.426784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:40.426784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V9e1nUUZIyFRWupv4Ysu5Lfdvaux4AxYrST0Uttt6JSYTlHluAvGd/Y4yPAJ6gYm8VTP6MyMSPyEd7n8KQSwDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:40.427322Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.09171","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28331efac7e6d7b48fdaf0c22c21ee8914c6d93606432ea775dd70b091f9e9e6","sha256:eba158dc1a3b0ffa162ebf70f2a89e62ac5b78771780dcfdf632f27265db810c"],"state_sha256":"8c0b3c98f85fd9bbfc85b825f3b45e78ed287f38ccea5f1379854aeb8efc41ea"}