{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GPNEEX6PT4FY3SPQX5QGOATPXE","short_pith_number":"pith:GPNEEX6P","schema_version":"1.0","canonical_sha256":"33da425fcf9f0b8dc9f0bf6067026fb9303addee9a1315052752067302c460a7","source":{"kind":"arxiv","id":"2302.11529","version":2},"attestation_state":"computed","paper":{"title":"Modular Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Edoardo Maria Ponti, Ivan Vuli\\'c, Jonas Pfeiffer, Sebastian Ruder","submitted_at":"2023-02-22T18:11:25Z","abstract_excerpt":"Transfer learning has recently become the dominant paradigm of machine learning. Pre-trained models fine-tuned for downstream tasks achieve better performance with fewer labelled examples. Nonetheless, it remains unclear how to develop models that specialise towards multiple tasks without incurring negative interference and that generalise systematically to non-identically distributed tasks. Modular deep learning has emerged as a promising solution to these challenges. In this framework, units of computation are often implemented as autonomous parameter-efficient modules. Information is condit"},"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":"2302.11529","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-22T18:11:25Z","cross_cats_sorted":[],"title_canon_sha256":"d30a7db11d05ecb6763a1f97a419f53ad5dff7032e328d7de22b784f2f2c5efd","abstract_canon_sha256":"e418f32442ed6d7559b56cc812cc11f0e56ba23db93e047baff757720eb79065"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:38:08.182254Z","signature_b64":"vnqaGH+j6DN89rPc3ERWt4ozpLGSp2Hh+/Nd2j3fH8t+14M5+6o0zepEhPYG/kmiUvuE5RtwS1jRZsmD+UfFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33da425fcf9f0b8dc9f0bf6067026fb9303addee9a1315052752067302c460a7","last_reissued_at":"2026-07-05T07:38:08.181842Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:38:08.181842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modular Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Edoardo Maria Ponti, Ivan Vuli\\'c, Jonas Pfeiffer, Sebastian Ruder","submitted_at":"2023-02-22T18:11:25Z","abstract_excerpt":"Transfer learning has recently become the dominant paradigm of machine learning. Pre-trained models fine-tuned for downstream tasks achieve better performance with fewer labelled examples. Nonetheless, it remains unclear how to develop models that specialise towards multiple tasks without incurring negative interference and that generalise systematically to non-identically distributed tasks. Modular deep learning has emerged as a promising solution to these challenges. In this framework, units of computation are often implemented as autonomous parameter-efficient modules. Information is condit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.11529","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/2302.11529/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":"2302.11529","created_at":"2026-07-05T07:38:08.181897+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.11529v2","created_at":"2026-07-05T07:38:08.181897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.11529","created_at":"2026-07-05T07:38:08.181897+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPNEEX6PT4FY","created_at":"2026-07-05T07:38:08.181897+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPNEEX6PT4FY3SPQ","created_at":"2026-07-05T07:38:08.181897+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPNEEX6P","created_at":"2026-07-05T07:38:08.181897+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.07239","citing_title":"Red-Bandit: Test-Time Adaptation for LLM Red-Teaming via Bandit-Guided LoRA Experts","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14364","citing_title":"MoRe: Modular Representations for Principled Continual Representation Learning on Sequential Data","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14364","citing_title":"MoRe: Modular Representations for Principled Continual Representation Learning on Sequential Data","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18498","citing_title":"DBES: A Systematic Benchmark and Metric Suite for Evaluating Expert Specialization in Large-Scale MoEs","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2603.18203","citing_title":"How Psychological Learning Paradigms Shaped and Constrained Artificial Intelligence","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14364","citing_title":"MoRe: Modular Representations for Principled Continual Representation Learning on Sequential Data","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12809","citing_title":"Correcting Influence: Unboxing LLM Outputs with Orthogonal Latent Spaces","ref_index":255,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GPNEEX6PT4FY3SPQX5QGOATPXE","json":"https://pith.science/pith/GPNEEX6PT4FY3SPQX5QGOATPXE.json","graph_json":"https://pith.science/api/pith-number/GPNEEX6PT4FY3SPQX5QGOATPXE/graph.json","events_json":"https://pith.science/api/pith-number/GPNEEX6PT4FY3SPQX5QGOATPXE/events.json","paper":"https://pith.science/paper/GPNEEX6P"},"agent_actions":{"view_html":"https://pith.science/pith/GPNEEX6PT4FY3SPQX5QGOATPXE","download_json":"https://pith.science/pith/GPNEEX6PT4FY3SPQX5QGOATPXE.json","view_paper":"https://pith.science/paper/GPNEEX6P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.11529&json=true","fetch_graph":"https://pith.science/api/pith-number/GPNEEX6PT4FY3SPQX5QGOATPXE/graph.json","fetch_events":"https://pith.science/api/pith-number/GPNEEX6PT4FY3SPQX5QGOATPXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPNEEX6PT4FY3SPQX5QGOATPXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPNEEX6PT4FY3SPQX5QGOATPXE/action/storage_attestation","attest_author":"https://pith.science/pith/GPNEEX6PT4FY3SPQX5QGOATPXE/action/author_attestation","sign_citation":"https://pith.science/pith/GPNEEX6PT4FY3SPQX5QGOATPXE/action/citation_signature","submit_replication":"https://pith.science/pith/GPNEEX6PT4FY3SPQX5QGOATPXE/action/replication_record"}},"created_at":"2026-07-05T07:38:08.181897+00:00","updated_at":"2026-07-05T07:38:08.181897+00:00"}