{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YOY6TBYARFJF2G3V3S4M34UNGY","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":"fa2552fdd460b7651ccf7f5c076f575c0a6130e49922c464c7cdea62ff24ea6b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T04:46:54Z","title_canon_sha256":"9c0f49b120c35100040d7ce1bd3fc374d14e2bc406ee8d5c999f32db6b9d429a"},"schema_version":"1.0","source":{"id":"2605.14364","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14364","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14364v1","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14364","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"YOY6TBYARFJF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"YOY6TBYARFJF2G3V","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"YOY6TBYA","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:370ee70a8276ad8f9d374b265ec92dbe180bf7eeea76cd24542caf29bf683aa0","target":"graph","created_at":"2026-05-17T23:39:07Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"MoRe decomposes knowledge into a hierarchy of fundamental and specific modules with identifiability guarantees, enabling principled module reuse, alignment, and expansion during adaptation while preserving old modules by construction."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That time-delayed dependencies in sequential data naturally reveal an intrinsic modular organization in representations that can be identified independently of task boundaries."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"MoRe decomposes representations into identifiable hierarchical modules to enable principled continual adaptation on sequential data."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"MoRe decomposes sequential representations into identifiable hierarchies of fundamental and specific modules to support continual adaptation while preserving prior knowledge by construction."}],"snapshot_sha256":"ed44d33cd1e2a38c6cb4d77a6496b9b5d2b152d5be5fe0b62e9f218f37356d6f"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Continual learning requires models to adapt to new data while preserving previously acquired knowledge. At its core, this challenge can be viewed as principled one-step adaptation: incorporating new information with minimal interference to existing representations. Most existing approaches address this challenge by modifying model parameters or architectures in a supervised, task-specific manner. However, the underlying issue is representational: tasks require distinct yet structured representations that can be selectively updated without disrupting representations, while structure should refl","authors_text":"Boyang Sun, Jiaqi Sun, Kun Zhang, Mohamad Rasmy, Xiangchen Song","cross_cats":[],"headline":"MoRe decomposes sequential representations into identifiable hierarchies of fundamental and specific modules to support continual adaptation while preserving prior knowledge by construction.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T04:46:54Z","title":"MoRe: Modular Representations for Principled Continual Representation Learning on Squantial Data"},"references":{"count":43,"internal_anchors":5,"resolved_work":43,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"R. Aljundi, F. Babiloni, M. Elhoseiny, M. Rohrbach, and T. Tuytelaars. Memory aware synapses: Learning what (not) to forget. InProceedings of the European conference on computer vision (ECCV), pages 1","work_id":"bdcd9433-fe98-4094-97c7-84ddb016eaeb","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"R. Aljundi, P. Chakravarty, and T. Tuytelaars. Expert gate: Lifelong learning with a network of experts. InProceedings of the IEEE conference on computer vision and pattern recognition, pages 3366–337","work_id":"a985de6b-b9ac-4b4f-a59c-3622f385ec28","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"S. Biderman, H. Schoelkopf, Q. G. Anthony, H. Bradley, K. O’Brien, E. Hallahan, M. A. Khan, S. Purohit, U. S. Prashanth, E. Raff, et al. Pythia: A suite for analyzing large language models across trai","work_id":"b5a6c43d-67f2-4ea9-87a5-68389adf52d8","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"W. Chen, Y . Zhou, N. Du, Y . Huang, J. Laudon, Z. Chen, and C. Cui. Lifelong language pretraining with distribution-specialized experts. InInternational Conference on Machine Learning, pages 5383–539","work_id":"6becdbcc-14e7-4b7a-ba18-1986b952264a","year":2023},{"cited_arxiv_id":"1701.08734","doi":"","is_internal_anchor":true,"ref_index":5,"title":"PathNet: Evolution Channels Gradient Descent in Super Neural Networks","work_id":"67145523-6c66-41a2-a3b0-ceb37c0dc852","year":2017}],"snapshot_sha256":"8f29a60f134d5b29688be41f138d508ae0455e3b629446c4dacd71d303d6a405"},"source":{"id":"2605.14364","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:52:29.009043Z","id":"69d79d71-4664-436c-92f8-bec6774fb496","model_set":{"reader":"grok-4.3"},"one_line_summary":"MoRe decomposes representations into identifiable hierarchical modules to enable principled continual adaptation on sequential data.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"MoRe decomposes sequential representations into identifiable hierarchies of fundamental and specific modules to support continual adaptation while preserving prior knowledge by construction.","strongest_claim":"MoRe decomposes knowledge into a hierarchy of fundamental and specific modules with identifiability guarantees, enabling principled module reuse, alignment, and expansion during adaptation while preserving old modules by construction.","weakest_assumption":"That time-delayed dependencies in sequential data naturally reveal an intrinsic modular organization in representations that can be identified independently of task boundaries."}},"verdict_id":"69d79d71-4664-436c-92f8-bec6774fb496"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6ce4b3369210c0b087868c2935f32edc39fbbf1e9501177bbe98aa20edcf4956","target":"record","created_at":"2026-05-17T23:39:07Z","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":"fa2552fdd460b7651ccf7f5c076f575c0a6130e49922c464c7cdea62ff24ea6b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T04:46:54Z","title_canon_sha256":"9c0f49b120c35100040d7ce1bd3fc374d14e2bc406ee8d5c999f32db6b9d429a"},"schema_version":"1.0","source":{"id":"2605.14364","kind":"arxiv","version":1}},"canonical_sha256":"c3b1e9870089525d1b75dcb8cdf28d362f5a8b210ff715d3a9cd0edd7e7f16f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3b1e9870089525d1b75dcb8cdf28d362f5a8b210ff715d3a9cd0edd7e7f16f6","first_computed_at":"2026-05-17T23:39:07.911776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:07.911776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7n96FrZBI27TMvtVIechcScjSxaf15QkY36Ih5BPfInE1HUDUrLPMFqDTiyr4J/fEVr0Pbtuy4MFq03ip+UmBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:07.912738Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14364","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ce4b3369210c0b087868c2935f32edc39fbbf1e9501177bbe98aa20edcf4956","sha256:370ee70a8276ad8f9d374b265ec92dbe180bf7eeea76cd24542caf29bf683aa0"],"state_sha256":"3598cf7bffe77cf76ed95c78198bf2229c43c5eef7ede1daa1bf5dd9723b809e"}