{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:2IZ33IPTKBEAJGOXONCGRDNAZF","short_pith_number":"pith:2IZ33IPT","canonical_record":{"source":{"id":"2507.21479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-07-29T03:47:22Z","cross_cats_sorted":["cs.AI","cs.IT","cs.SY","eess.SY","math.IT","stat.ML"],"title_canon_sha256":"5a078eee73578de79d07192295fc42055e547d558ee55922521aea20fbe2e794","abstract_canon_sha256":"a7e3c5a8e0ad1dec0cdea11ee1031b6bb4e6a37234b0e85e4086429f589b01f4"},"schema_version":"1.0"},"canonical_sha256":"d233bda1f350480499d77344688da0c967e43ab325c722aaf96c502c7ff59a63","source":{"kind":"arxiv","id":"2507.21479","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.21479","created_at":"2026-07-05T11:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"2507.21479v1","created_at":"2026-07-05T11:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.21479","created_at":"2026-07-05T11:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"2IZ33IPTKBEA","created_at":"2026-07-05T11:45:00Z"},{"alias_kind":"pith_short_16","alias_value":"2IZ33IPTKBEAJGOX","created_at":"2026-07-05T11:45:00Z"},{"alias_kind":"pith_short_8","alias_value":"2IZ33IPT","created_at":"2026-07-05T11:45:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:2IZ33IPTKBEAJGOXONCGRDNAZF","target":"record","payload":{"canonical_record":{"source":{"id":"2507.21479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-07-29T03:47:22Z","cross_cats_sorted":["cs.AI","cs.IT","cs.SY","eess.SY","math.IT","stat.ML"],"title_canon_sha256":"5a078eee73578de79d07192295fc42055e547d558ee55922521aea20fbe2e794","abstract_canon_sha256":"a7e3c5a8e0ad1dec0cdea11ee1031b6bb4e6a37234b0e85e4086429f589b01f4"},"schema_version":"1.0"},"canonical_sha256":"d233bda1f350480499d77344688da0c967e43ab325c722aaf96c502c7ff59a63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:00.776689Z","signature_b64":"j3cmp+7b2R+N6u3g0FndxEPY+OtA/77OVH0QfxDrp4ayrNhyq4sNvw7+zkD67kFGCtlTsWQZ5CwLexlzn/1OBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d233bda1f350480499d77344688da0c967e43ab325c722aaf96c502c7ff59a63","last_reissued_at":"2026-07-05T11:45:00.776220Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:00.776220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.21479","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:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c7zK3mAvsz9uk6Xj09bHaxB1X0nbI+1T9JhGy3QVq9Y42BH2UMvIR5HAQiSnXkUnV/jDc/MG/oxHJW53kdwKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T07:50:40.362687Z"},"content_sha256":"86f32fe8811ac1119ff554176ac9deb4947d8a843dc37b0f45c445712b59d75d","schema_version":"1.0","event_id":"sha256:86f32fe8811ac1119ff554176ac9deb4947d8a843dc37b0f45c445712b59d75d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:2IZ33IPTKBEAJGOXONCGRDNAZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity-Constrained Continual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","cs.SY","eess.SY","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Benjamin Van Roy, Doina Precup, Satinder Singh, Zheng Wen","submitted_at":"2025-07-29T03:47:22Z","abstract_excerpt":"Any agents we can possibly build are subject to capacity constraints, as memory and compute resources are inherently finite. However, comparatively little attention has been dedicated to understanding how agents with limited capacity should allocate their resources for optimal performance. The goal of this paper is to shed some light on this question by studying a simple yet relevant continual learning problem: the capacity-constrained linear-quadratic-Gaussian (LQG) sequential prediction problem. We derive a solution to this problem under appropriate technical conditions. Moreover, for proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.21479","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/2507.21479/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:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JmWV1GJ/XoZQKX2ctaLZ7sQ6o0yLCnnNqmJFH+A2MqT03rqSsW2o2coZVnxXB0BCxP6Zikyyp3YcePzKA3BLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T07:50:40.363181Z"},"content_sha256":"fef1df889b24bb1119def59d2925533691c2059b60164905a2c75d76be09fd47","schema_version":"1.0","event_id":"sha256:fef1df889b24bb1119def59d2925533691c2059b60164905a2c75d76be09fd47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2IZ33IPTKBEAJGOXONCGRDNAZF/bundle.json","state_url":"https://pith.science/pith/2IZ33IPTKBEAJGOXONCGRDNAZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2IZ33IPTKBEAJGOXONCGRDNAZF/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-06T07:50:40Z","links":{"resolver":"https://pith.science/pith/2IZ33IPTKBEAJGOXONCGRDNAZF","bundle":"https://pith.science/pith/2IZ33IPTKBEAJGOXONCGRDNAZF/bundle.json","state":"https://pith.science/pith/2IZ33IPTKBEAJGOXONCGRDNAZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2IZ33IPTKBEAJGOXONCGRDNAZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:2IZ33IPTKBEAJGOXONCGRDNAZF","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":"a7e3c5a8e0ad1dec0cdea11ee1031b6bb4e6a37234b0e85e4086429f589b01f4","cross_cats_sorted":["cs.AI","cs.IT","cs.SY","eess.SY","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-07-29T03:47:22Z","title_canon_sha256":"5a078eee73578de79d07192295fc42055e547d558ee55922521aea20fbe2e794"},"schema_version":"1.0","source":{"id":"2507.21479","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.21479","created_at":"2026-07-05T11:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"2507.21479v1","created_at":"2026-07-05T11:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.21479","created_at":"2026-07-05T11:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"2IZ33IPTKBEA","created_at":"2026-07-05T11:45:00Z"},{"alias_kind":"pith_short_16","alias_value":"2IZ33IPTKBEAJGOX","created_at":"2026-07-05T11:45:00Z"},{"alias_kind":"pith_short_8","alias_value":"2IZ33IPT","created_at":"2026-07-05T11:45:00Z"}],"graph_snapshots":[{"event_id":"sha256:fef1df889b24bb1119def59d2925533691c2059b60164905a2c75d76be09fd47","target":"graph","created_at":"2026-07-05T11:45:00Z","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/2507.21479/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Any agents we can possibly build are subject to capacity constraints, as memory and compute resources are inherently finite. However, comparatively little attention has been dedicated to understanding how agents with limited capacity should allocate their resources for optimal performance. The goal of this paper is to shed some light on this question by studying a simple yet relevant continual learning problem: the capacity-constrained linear-quadratic-Gaussian (LQG) sequential prediction problem. We derive a solution to this problem under appropriate technical conditions. Moreover, for proble","authors_text":"Benjamin Van Roy, Doina Precup, Satinder Singh, Zheng Wen","cross_cats":["cs.AI","cs.IT","cs.SY","eess.SY","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-07-29T03:47:22Z","title":"Capacity-Constrained Continual Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.21479","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:86f32fe8811ac1119ff554176ac9deb4947d8a843dc37b0f45c445712b59d75d","target":"record","created_at":"2026-07-05T11:45:00Z","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":"a7e3c5a8e0ad1dec0cdea11ee1031b6bb4e6a37234b0e85e4086429f589b01f4","cross_cats_sorted":["cs.AI","cs.IT","cs.SY","eess.SY","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-07-29T03:47:22Z","title_canon_sha256":"5a078eee73578de79d07192295fc42055e547d558ee55922521aea20fbe2e794"},"schema_version":"1.0","source":{"id":"2507.21479","kind":"arxiv","version":1}},"canonical_sha256":"d233bda1f350480499d77344688da0c967e43ab325c722aaf96c502c7ff59a63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d233bda1f350480499d77344688da0c967e43ab325c722aaf96c502c7ff59a63","first_computed_at":"2026-07-05T11:45:00.776220Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:45:00.776220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j3cmp+7b2R+N6u3g0FndxEPY+OtA/77OVH0QfxDrp4ayrNhyq4sNvw7+zkD67kFGCtlTsWQZ5CwLexlzn/1OBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:45:00.776689Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.21479","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86f32fe8811ac1119ff554176ac9deb4947d8a843dc37b0f45c445712b59d75d","sha256:fef1df889b24bb1119def59d2925533691c2059b60164905a2c75d76be09fd47"],"state_sha256":"98d7b6ac61f86e0d4db6cb0a3c7390ae93547553055df96f216ebd5c7b80dbb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vctA5JrG0NhsgTR5LxlLwdzcDYBXqA29gGkuG9OS9i7ydYogkBahFHXLuWp2f5AhKkRkB0Xu3ZC7uT4dc7I+BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T07:50:40.366700Z","bundle_sha256":"0751597e291a339b7bc22686e66cdc635afe08e0be2b6d8188a28a6f864046b1"}}