{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FOKRQ3FQOIWWTLKBSDIJHL7EIG","short_pith_number":"pith:FOKRQ3FQ","canonical_record":{"source":{"id":"1904.05098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-10T10:25:19Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"d71b3cf4c18822f8a0fda089b33af42c96fcdfca4225a1f8d3a4b9899e96cd02","abstract_canon_sha256":"9091aba61a6bae1ecc7408b82e24e61c98c9cfeef49fa56c9d835224b8d5f1a9"},"schema_version":"1.0"},"canonical_sha256":"2b95186cb0722d69ad4190d093afe441bc896b025a8034dac4f24cc85d0f4d3a","source":{"kind":"arxiv","id":"1904.05098","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05098","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05098v1","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05098","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"pith_short_12","alias_value":"FOKRQ3FQOIWW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FOKRQ3FQOIWWTLKB","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FOKRQ3FQ","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FOKRQ3FQOIWWTLKBSDIJHL7EIG","target":"record","payload":{"canonical_record":{"source":{"id":"1904.05098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-10T10:25:19Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"d71b3cf4c18822f8a0fda089b33af42c96fcdfca4225a1f8d3a4b9899e96cd02","abstract_canon_sha256":"9091aba61a6bae1ecc7408b82e24e61c98c9cfeef49fa56c9d835224b8d5f1a9"},"schema_version":"1.0"},"canonical_sha256":"2b95186cb0722d69ad4190d093afe441bc896b025a8034dac4f24cc85d0f4d3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:54.153376Z","signature_b64":"bP+wYuzzlZbYG+OSHJIJpsMnY+vM+7M7yLoYuY9UU7f/KmdoFeowZO7X+fzktXs9PrMYhIe5L8XAGwEWRnriBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b95186cb0722d69ad4190d093afe441bc896b025a8034dac4f24cc85d0f4d3a","last_reissued_at":"2026-05-17T23:48:54.152478Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:54.152478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.05098","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:48:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QWp0UKtkLapDlSpcp9JobFX3/QD2TctBkY1rGT4tQ4tf9oWeTjihGl5u0kA8NUDqCaPMom9N58CzuaggpwIdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:09:00.336250Z"},"content_sha256":"7fabf7454871c165ce8f791226eb1d39453c4f6c3431bf546f55aa288d92425c","schema_version":"1.0","event_id":"sha256:7fabf7454871c165ce8f791226eb1d39453c4f6c3431bf546f55aa288d92425c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FOKRQ3FQOIWWTLKBSDIJHL7EIG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multitask Hopfield Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Giorgio Valentini, Giuliano Grossi, Marco Frasca","submitted_at":"2019-04-10T10:25:19Z","abstract_excerpt":"Multitask algorithms typically use task similarity information as a bias to speed up and improve the performance of learning processes. Tasks are learned jointly, sharing information across them, in order to construct models more accurate than those learned separately over single tasks. In this contribution, we present the first multitask model, to our knowledge, based on Hopfield Networks (HNs), named HoMTask. We show that by appropriately building a unique HN embedding all tasks, a more robust and effective classification model can be learned. HoMTask is a transductive semi-supervised parame"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05098","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:48:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t9mxuR6seeer4kctODrdapYn2JQSNvVfd+dcktSG4PUArFoZPsKivMsjGooRFQqI4a38OmIZdP7LRPhNynMrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:09:00.336901Z"},"content_sha256":"e75d1662812400d0ca374d61803413bb89a6079e3c81370490c385ca7c572727","schema_version":"1.0","event_id":"sha256:e75d1662812400d0ca374d61803413bb89a6079e3c81370490c385ca7c572727"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FOKRQ3FQOIWWTLKBSDIJHL7EIG/bundle.json","state_url":"https://pith.science/pith/FOKRQ3FQOIWWTLKBSDIJHL7EIG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FOKRQ3FQOIWWTLKBSDIJHL7EIG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T13:09:00Z","links":{"resolver":"https://pith.science/pith/FOKRQ3FQOIWWTLKBSDIJHL7EIG","bundle":"https://pith.science/pith/FOKRQ3FQOIWWTLKBSDIJHL7EIG/bundle.json","state":"https://pith.science/pith/FOKRQ3FQOIWWTLKBSDIJHL7EIG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FOKRQ3FQOIWWTLKBSDIJHL7EIG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FOKRQ3FQOIWWTLKBSDIJHL7EIG","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":"9091aba61a6bae1ecc7408b82e24e61c98c9cfeef49fa56c9d835224b8d5f1a9","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-10T10:25:19Z","title_canon_sha256":"d71b3cf4c18822f8a0fda089b33af42c96fcdfca4225a1f8d3a4b9899e96cd02"},"schema_version":"1.0","source":{"id":"1904.05098","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05098","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05098v1","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05098","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"pith_short_12","alias_value":"FOKRQ3FQOIWW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FOKRQ3FQOIWWTLKB","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FOKRQ3FQ","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:e75d1662812400d0ca374d61803413bb89a6079e3c81370490c385ca7c572727","target":"graph","created_at":"2026-05-17T23:48:54Z","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":"Multitask algorithms typically use task similarity information as a bias to speed up and improve the performance of learning processes. Tasks are learned jointly, sharing information across them, in order to construct models more accurate than those learned separately over single tasks. In this contribution, we present the first multitask model, to our knowledge, based on Hopfield Networks (HNs), named HoMTask. We show that by appropriately building a unique HN embedding all tasks, a more robust and effective classification model can be learned. HoMTask is a transductive semi-supervised parame","authors_text":"Giorgio Valentini, Giuliano Grossi, Marco Frasca","cross_cats":["cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-10T10:25:19Z","title":"Multitask Hopfield Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05098","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:7fabf7454871c165ce8f791226eb1d39453c4f6c3431bf546f55aa288d92425c","target":"record","created_at":"2026-05-17T23:48:54Z","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":"9091aba61a6bae1ecc7408b82e24e61c98c9cfeef49fa56c9d835224b8d5f1a9","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-10T10:25:19Z","title_canon_sha256":"d71b3cf4c18822f8a0fda089b33af42c96fcdfca4225a1f8d3a4b9899e96cd02"},"schema_version":"1.0","source":{"id":"1904.05098","kind":"arxiv","version":1}},"canonical_sha256":"2b95186cb0722d69ad4190d093afe441bc896b025a8034dac4f24cc85d0f4d3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b95186cb0722d69ad4190d093afe441bc896b025a8034dac4f24cc85d0f4d3a","first_computed_at":"2026-05-17T23:48:54.152478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:54.152478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bP+wYuzzlZbYG+OSHJIJpsMnY+vM+7M7yLoYuY9UU7f/KmdoFeowZO7X+fzktXs9PrMYhIe5L8XAGwEWRnriBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:54.153376Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.05098","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fabf7454871c165ce8f791226eb1d39453c4f6c3431bf546f55aa288d92425c","sha256:e75d1662812400d0ca374d61803413bb89a6079e3c81370490c385ca7c572727"],"state_sha256":"e4346d5a4faa3eb9a003ccb6a6d2951af7d68caec27c6e8b57c2c7efefc40ed2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DocCWAdl6lJpx29o8Lu8umvKF3HD+OGbJXg+VxKB7gTRATCZFKxeecssg9kGtAxGol+gjFtNsWwdd6Kv91oRAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T13:09:00.340064Z","bundle_sha256":"bee9a3ca0ef60c98552972c9d7f280b36d8295efba111f9718a0381194c948b5"}}