{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:BQTHOEFGUJZLUGZC33CSVE52FQ","short_pith_number":"pith:BQTHOEFG","canonical_record":{"source":{"id":"2506.14811","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-04T15:12:15Z","cross_cats_sorted":[],"title_canon_sha256":"094a2f84ed778a594936f108c0901839ad61729502a951a5198567c11672ff21","abstract_canon_sha256":"b52bea872c27a3c8621c235d1b602b437e7dff5d7d70b19c8c88cee21d4f040b"},"schema_version":"1.0"},"canonical_sha256":"0c267710a6a272ba1b22dec52a93ba2c05ecb999a504784aab0ea74a3e33b4ba","source":{"kind":"arxiv","id":"2506.14811","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.14811","created_at":"2026-07-05T11:23:31Z"},{"alias_kind":"arxiv_version","alias_value":"2506.14811v1","created_at":"2026-07-05T11:23:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.14811","created_at":"2026-07-05T11:23:31Z"},{"alias_kind":"pith_short_12","alias_value":"BQTHOEFGUJZL","created_at":"2026-07-05T11:23:31Z"},{"alias_kind":"pith_short_16","alias_value":"BQTHOEFGUJZLUGZC","created_at":"2026-07-05T11:23:31Z"},{"alias_kind":"pith_short_8","alias_value":"BQTHOEFG","created_at":"2026-07-05T11:23:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:BQTHOEFGUJZLUGZC33CSVE52FQ","target":"record","payload":{"canonical_record":{"source":{"id":"2506.14811","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-04T15:12:15Z","cross_cats_sorted":[],"title_canon_sha256":"094a2f84ed778a594936f108c0901839ad61729502a951a5198567c11672ff21","abstract_canon_sha256":"b52bea872c27a3c8621c235d1b602b437e7dff5d7d70b19c8c88cee21d4f040b"},"schema_version":"1.0"},"canonical_sha256":"0c267710a6a272ba1b22dec52a93ba2c05ecb999a504784aab0ea74a3e33b4ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:31.918602Z","signature_b64":"kOiCknjojNNWEt3s+lo52r7ZrnqdUgtD5UTuPMrS3f/m8H13bGfXO25MDQ+aKvofJzI5YQeE+a70fMZTXni7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c267710a6a272ba1b22dec52a93ba2c05ecb999a504784aab0ea74a3e33b4ba","last_reissued_at":"2026-07-05T11:23:31.918035Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:31.918035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.14811","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-05T11:23:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SdufOhGIpVGoYpEJbG/kbdosa1WjSYdgVsue9QagQbiQjymbGvok5liRl8+iSSRbhcvWViZ0eYjm6UJMHZZMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T21:42:15.349427Z"},"content_sha256":"75de99a0392dccb0ce4dd7c755a7a144d2a498833dd765f26ff7ef5d2d270aca","schema_version":"1.0","event_id":"sha256:75de99a0392dccb0ce4dd7c755a7a144d2a498833dd765f26ff7ef5d2d270aca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:BQTHOEFGUJZLUGZC33CSVE52FQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-Composing Policies for Scalable Continual Reinforcement Learning","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jose A. Lozano, Josu Ceberio, Mikel Malag\\'on","submitted_at":"2025-06-04T15:12:15Z","abstract_excerpt":"This work introduces a growable and modular neural network architecture that naturally avoids catastrophic forgetting and interference in continual reinforcement learning. The structure of each module allows the selective combination of previous policies along with its internal policy, accelerating the learning process on the current task. Unlike previous growing neural network approaches, we show that the number of parameters of the proposed approach grows linearly with respect to the number of tasks, and does not sacrifice plasticity to scale. Experiments conducted in benchmark continuous co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.14811","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/2506.14811/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-05T11:23:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jnaKAy0sl8SoPd28h6DWRYm+jgemox4P5LZLJyI2iuLTy71yqjTdTauHeQit7qcseh9I67vUXeN4Sk+W32eoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T21:42:15.349804Z"},"content_sha256":"9634d66b9b68960468b92e5c0c4fee6505985cafbeb0e4bcb2401b8d09ea86ed","schema_version":"1.0","event_id":"sha256:9634d66b9b68960468b92e5c0c4fee6505985cafbeb0e4bcb2401b8d09ea86ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQTHOEFGUJZLUGZC33CSVE52FQ/bundle.json","state_url":"https://pith.science/pith/BQTHOEFGUJZLUGZC33CSVE52FQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQTHOEFGUJZLUGZC33CSVE52FQ/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-08-05T21:42:15Z","links":{"resolver":"https://pith.science/pith/BQTHOEFGUJZLUGZC33CSVE52FQ","bundle":"https://pith.science/pith/BQTHOEFGUJZLUGZC33CSVE52FQ/bundle.json","state":"https://pith.science/pith/BQTHOEFGUJZLUGZC33CSVE52FQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQTHOEFGUJZLUGZC33CSVE52FQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BQTHOEFGUJZLUGZC33CSVE52FQ","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":"b52bea872c27a3c8621c235d1b602b437e7dff5d7d70b19c8c88cee21d4f040b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-04T15:12:15Z","title_canon_sha256":"094a2f84ed778a594936f108c0901839ad61729502a951a5198567c11672ff21"},"schema_version":"1.0","source":{"id":"2506.14811","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.14811","created_at":"2026-07-05T11:23:31Z"},{"alias_kind":"arxiv_version","alias_value":"2506.14811v1","created_at":"2026-07-05T11:23:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.14811","created_at":"2026-07-05T11:23:31Z"},{"alias_kind":"pith_short_12","alias_value":"BQTHOEFGUJZL","created_at":"2026-07-05T11:23:31Z"},{"alias_kind":"pith_short_16","alias_value":"BQTHOEFGUJZLUGZC","created_at":"2026-07-05T11:23:31Z"},{"alias_kind":"pith_short_8","alias_value":"BQTHOEFG","created_at":"2026-07-05T11:23:31Z"}],"graph_snapshots":[{"event_id":"sha256:9634d66b9b68960468b92e5c0c4fee6505985cafbeb0e4bcb2401b8d09ea86ed","target":"graph","created_at":"2026-07-05T11:23:31Z","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/2506.14811/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work introduces a growable and modular neural network architecture that naturally avoids catastrophic forgetting and interference in continual reinforcement learning. The structure of each module allows the selective combination of previous policies along with its internal policy, accelerating the learning process on the current task. Unlike previous growing neural network approaches, we show that the number of parameters of the proposed approach grows linearly with respect to the number of tasks, and does not sacrifice plasticity to scale. Experiments conducted in benchmark continuous co","authors_text":"Jose A. Lozano, Josu Ceberio, Mikel Malag\\'on","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-04T15:12:15Z","title":"Self-Composing Policies for Scalable Continual Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.14811","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:75de99a0392dccb0ce4dd7c755a7a144d2a498833dd765f26ff7ef5d2d270aca","target":"record","created_at":"2026-07-05T11:23:31Z","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":"b52bea872c27a3c8621c235d1b602b437e7dff5d7d70b19c8c88cee21d4f040b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-04T15:12:15Z","title_canon_sha256":"094a2f84ed778a594936f108c0901839ad61729502a951a5198567c11672ff21"},"schema_version":"1.0","source":{"id":"2506.14811","kind":"arxiv","version":1}},"canonical_sha256":"0c267710a6a272ba1b22dec52a93ba2c05ecb999a504784aab0ea74a3e33b4ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c267710a6a272ba1b22dec52a93ba2c05ecb999a504784aab0ea74a3e33b4ba","first_computed_at":"2026-07-05T11:23:31.918035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:23:31.918035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kOiCknjojNNWEt3s+lo52r7ZrnqdUgtD5UTuPMrS3f/m8H13bGfXO25MDQ+aKvofJzI5YQeE+a70fMZTXni7Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:23:31.918602Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.14811","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75de99a0392dccb0ce4dd7c755a7a144d2a498833dd765f26ff7ef5d2d270aca","sha256:9634d66b9b68960468b92e5c0c4fee6505985cafbeb0e4bcb2401b8d09ea86ed"],"state_sha256":"a197cc5f172a2df98187b04db572c46ef0d2a609ee961ba12447436c2d653dd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OxqMa48q+sZv8MlRYYvsTHIPgkNuhAHzXNJaZb8orHaOtEjEDkxH/AWU5RAm2nu8V8qOyZLrN4Fp6VqFEdNhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T21:42:15.352177Z","bundle_sha256":"16b292e403b278a332e665df2e480a13c51bc4fed2ce9f50cc6fcfc537733a37"}}