{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WIX7ZKCVZNWM4GY43Y5FWYHG7R","short_pith_number":"pith:WIX7ZKCV","canonical_record":{"source":{"id":"2412.17188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-22T23:27:20Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f67fb387747b91057c98c8ea2ffb9d171b579465477d02bab762a709e6f63893","abstract_canon_sha256":"8fd36ae7f37d13d9b3b2252ef4f826ec0356c5176316f24888ab49fad14e2a7b"},"schema_version":"1.0"},"canonical_sha256":"b22ffca855cb6cce1b1cde3a5b60e6fc480a62b223c56f51c6d5057503eb47e1","source":{"kind":"arxiv","id":"2412.17188","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.17188","created_at":"2026-07-05T09:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"2412.17188v1","created_at":"2026-07-05T09:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17188","created_at":"2026-07-05T09:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"WIX7ZKCVZNWM","created_at":"2026-07-05T09:53:18Z"},{"alias_kind":"pith_short_16","alias_value":"WIX7ZKCVZNWM4GY4","created_at":"2026-07-05T09:53:18Z"},{"alias_kind":"pith_short_8","alias_value":"WIX7ZKCV","created_at":"2026-07-05T09:53:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WIX7ZKCVZNWM4GY43Y5FWYHG7R","target":"record","payload":{"canonical_record":{"source":{"id":"2412.17188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-22T23:27:20Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f67fb387747b91057c98c8ea2ffb9d171b579465477d02bab762a709e6f63893","abstract_canon_sha256":"8fd36ae7f37d13d9b3b2252ef4f826ec0356c5176316f24888ab49fad14e2a7b"},"schema_version":"1.0"},"canonical_sha256":"b22ffca855cb6cce1b1cde3a5b60e6fc480a62b223c56f51c6d5057503eb47e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:18.623027Z","signature_b64":"dwlYQv2/WllRpF5vhJIMcNsrxi96ie55RnYqHGyDuau2oe7zZ7EFIrUTCAFsFmYjVrOgCDg6VL2A5QNqFjCqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b22ffca855cb6cce1b1cde3a5b60e6fc480a62b223c56f51c6d5057503eb47e1","last_reissued_at":"2026-07-05T09:53:18.622586Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:18.622586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.17188","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-07-05T09:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QhneBzMP5RG3+2Ax+7Iy6zayBW3xSOktXRtpaSpzc+TyFSXu8t4uvojyGc4dKu/fLKyBIRWTmuvfdL0AqXnRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:57:04.172842Z"},"content_sha256":"318bfc1fbb83b07a4923809ebedfa755679ae94fc4f4f28f8120e0a5bfd7f59d","schema_version":"1.0","event_id":"sha256:318bfc1fbb83b07a4923809ebedfa755679ae94fc4f4f28f8120e0a5bfd7f59d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WIX7ZKCVZNWM4GY43Y5FWYHG7R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchically Gated Experts for Efficient Online Continual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Kevin Luong, Michael Thielscher","submitted_at":"2024-12-22T23:27:20Z","abstract_excerpt":"Continual Learning models aim to learn a set of tasks under the constraint that the tasks arrive sequentially with no way to access data from previous tasks. The Online Continual Learning framework poses a further challenge where the tasks are unknown and instead the data arrives as a single stream. Building on existing work, we propose a method for identifying these underlying tasks: the Gated Experts (GE) algorithm, where a dynamically growing set of experts allows for new knowledge to be acquired without catastrophic forgetting. Furthermore, we extend GE to Hierarchically Gated Experts (HGE"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17188","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.17188/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"},"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-07-05T09:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zGBB65k/2YRuUsg1iDp+IN/S3XotlGto7aZYTebEKk7cXhgwTXNBxrvxQzFv83oucP2m4NOhdcabncXOnwCdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:57:04.173211Z"},"content_sha256":"6db3da8ad722ca81f716a512a7a8c427166de35c45c5c1a377f33acbcd673704","schema_version":"1.0","event_id":"sha256:6db3da8ad722ca81f716a512a7a8c427166de35c45c5c1a377f33acbcd673704"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WIX7ZKCVZNWM4GY43Y5FWYHG7R/bundle.json","state_url":"https://pith.science/pith/WIX7ZKCVZNWM4GY43Y5FWYHG7R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WIX7ZKCVZNWM4GY43Y5FWYHG7R/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-07-07T11:57:04Z","links":{"resolver":"https://pith.science/pith/WIX7ZKCVZNWM4GY43Y5FWYHG7R","bundle":"https://pith.science/pith/WIX7ZKCVZNWM4GY43Y5FWYHG7R/bundle.json","state":"https://pith.science/pith/WIX7ZKCVZNWM4GY43Y5FWYHG7R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WIX7ZKCVZNWM4GY43Y5FWYHG7R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WIX7ZKCVZNWM4GY43Y5FWYHG7R","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":"8fd36ae7f37d13d9b3b2252ef4f826ec0356c5176316f24888ab49fad14e2a7b","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-22T23:27:20Z","title_canon_sha256":"f67fb387747b91057c98c8ea2ffb9d171b579465477d02bab762a709e6f63893"},"schema_version":"1.0","source":{"id":"2412.17188","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.17188","created_at":"2026-07-05T09:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"2412.17188v1","created_at":"2026-07-05T09:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17188","created_at":"2026-07-05T09:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"WIX7ZKCVZNWM","created_at":"2026-07-05T09:53:18Z"},{"alias_kind":"pith_short_16","alias_value":"WIX7ZKCVZNWM4GY4","created_at":"2026-07-05T09:53:18Z"},{"alias_kind":"pith_short_8","alias_value":"WIX7ZKCV","created_at":"2026-07-05T09:53:18Z"}],"graph_snapshots":[{"event_id":"sha256:6db3da8ad722ca81f716a512a7a8c427166de35c45c5c1a377f33acbcd673704","target":"graph","created_at":"2026-07-05T09:53:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.17188/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Continual Learning models aim to learn a set of tasks under the constraint that the tasks arrive sequentially with no way to access data from previous tasks. The Online Continual Learning framework poses a further challenge where the tasks are unknown and instead the data arrives as a single stream. Building on existing work, we propose a method for identifying these underlying tasks: the Gated Experts (GE) algorithm, where a dynamically growing set of experts allows for new knowledge to be acquired without catastrophic forgetting. Furthermore, we extend GE to Hierarchically Gated Experts (HGE","authors_text":"Kevin Luong, Michael Thielscher","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-22T23:27:20Z","title":"Hierarchically Gated Experts for Efficient Online Continual Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17188","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:318bfc1fbb83b07a4923809ebedfa755679ae94fc4f4f28f8120e0a5bfd7f59d","target":"record","created_at":"2026-07-05T09:53:18Z","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":"8fd36ae7f37d13d9b3b2252ef4f826ec0356c5176316f24888ab49fad14e2a7b","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-22T23:27:20Z","title_canon_sha256":"f67fb387747b91057c98c8ea2ffb9d171b579465477d02bab762a709e6f63893"},"schema_version":"1.0","source":{"id":"2412.17188","kind":"arxiv","version":1}},"canonical_sha256":"b22ffca855cb6cce1b1cde3a5b60e6fc480a62b223c56f51c6d5057503eb47e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b22ffca855cb6cce1b1cde3a5b60e6fc480a62b223c56f51c6d5057503eb47e1","first_computed_at":"2026-07-05T09:53:18.622586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:53:18.622586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dwlYQv2/WllRpF5vhJIMcNsrxi96ie55RnYqHGyDuau2oe7zZ7EFIrUTCAFsFmYjVrOgCDg6VL2A5QNqFjCqCg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:53:18.623027Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.17188","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:318bfc1fbb83b07a4923809ebedfa755679ae94fc4f4f28f8120e0a5bfd7f59d","sha256:6db3da8ad722ca81f716a512a7a8c427166de35c45c5c1a377f33acbcd673704"],"state_sha256":"28abcc53713725671c3015655e3f72aa5c4f9564ab40d5adb6e599ae88b42b9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MCz4to5K4tx5Lx9cZw04Gmm/OaeebxMA1tROw/GHVmvVezcJqVx+V1yy7vVuNLeW7q6XrWzgIK8DpeugAvhyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:57:04.175107Z","bundle_sha256":"d50d07d086093feab88c5fb013f6775770e3e343781d5a21479320e21cdb96e9"}}