{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:GZJPF47WITQTVEJSITO3CZKPRV","short_pith_number":"pith:GZJPF47W","canonical_record":{"source":{"id":"2103.09762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-17T16:31:29Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"55284b3e0592a68b045fc03d549ad1bbb415e00d771291e388781532acf2a761","abstract_canon_sha256":"ef82253febebf5d423ce3f600fde0c3d1c5dbcc58d21e5ed0a1f1dbf9b289f7f"},"schema_version":"1.0"},"canonical_sha256":"3652f2f3f644e13a913244ddb1654f8d7f2e4c28eda926db3f16cc4be2853a66","source":{"kind":"arxiv","id":"2103.09762","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.09762","created_at":"2026-07-05T02:24:07Z"},{"alias_kind":"arxiv_version","alias_value":"2103.09762v1","created_at":"2026-07-05T02:24:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.09762","created_at":"2026-07-05T02:24:07Z"},{"alias_kind":"pith_short_12","alias_value":"GZJPF47WITQT","created_at":"2026-07-05T02:24:07Z"},{"alias_kind":"pith_short_16","alias_value":"GZJPF47WITQTVEJS","created_at":"2026-07-05T02:24:07Z"},{"alias_kind":"pith_short_8","alias_value":"GZJPF47W","created_at":"2026-07-05T02:24:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:GZJPF47WITQTVEJSITO3CZKPRV","target":"record","payload":{"canonical_record":{"source":{"id":"2103.09762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-17T16:31:29Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"55284b3e0592a68b045fc03d549ad1bbb415e00d771291e388781532acf2a761","abstract_canon_sha256":"ef82253febebf5d423ce3f600fde0c3d1c5dbcc58d21e5ed0a1f1dbf9b289f7f"},"schema_version":"1.0"},"canonical_sha256":"3652f2f3f644e13a913244ddb1654f8d7f2e4c28eda926db3f16cc4be2853a66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:24:07.122146Z","signature_b64":"p7ZCa+TFQDWWrwi8lLmAdo/eqqkCUIvyX7266eB9Q7JjFjYqt9oeMPGUalXB0jH68X0j5TLLLGYYaCGD6xwnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3652f2f3f644e13a913244ddb1654f8d7f2e4c28eda926db3f16cc4be2853a66","last_reissued_at":"2026-07-05T02:24:07.121740Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:24:07.121740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.09762","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-05T02:24:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IyYB7SOwNoFnBrBOolBgOwjmVjFERsqK1Hq3cmk8yNvbj52lKsY6MWYF5MR9NvYbnhMvPU+SAEFwRulB8SUyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T08:58:38.621850Z"},"content_sha256":"098a87d3a6cf536b346cfae9f1af37d4c19390bb0a96ad67bda0ee3c48eff287","schema_version":"1.0","event_id":"sha256:098a87d3a6cf536b346cfae9f1af37d4c19390bb0a96ad67bda0ee3c48eff287"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:GZJPF47WITQTVEJSITO3CZKPRV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gradient Projection Memory for Continual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Gobinda Saha, Isha Garg, Kaushik Roy","submitted_at":"2021-03-17T16:31:29Z","abstract_excerpt":"The ability to learn continually without forgetting the past tasks is a desired attribute for artificial learning systems. Existing approaches to enable such learning in artificial neural networks usually rely on network growth, importance based weight update or replay of old data from the memory. In contrast, we propose a novel approach where a neural network learns new tasks by taking gradient steps in the orthogonal direction to the gradient subspaces deemed important for the past tasks. We find the bases of these subspaces by analyzing network representations (activations) after learning e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.09762","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/2103.09762/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-05T02:24:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XSx23PvP2uhYxGcsKFMkRwN9Rt7Zg1MLxrKTkv1U1Y0lMvZTrDXWQGeJOka7V/EYb7mGpm0rUk8CO4RnH4D8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T08:58:38.622245Z"},"content_sha256":"f1badc160e342e61ced8bb03e071f5618b5faa1e1672a9f86e48e10c7b994ded","schema_version":"1.0","event_id":"sha256:f1badc160e342e61ced8bb03e071f5618b5faa1e1672a9f86e48e10c7b994ded"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZJPF47WITQTVEJSITO3CZKPRV/bundle.json","state_url":"https://pith.science/pith/GZJPF47WITQTVEJSITO3CZKPRV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZJPF47WITQTVEJSITO3CZKPRV/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-06T08:58:38Z","links":{"resolver":"https://pith.science/pith/GZJPF47WITQTVEJSITO3CZKPRV","bundle":"https://pith.science/pith/GZJPF47WITQTVEJSITO3CZKPRV/bundle.json","state":"https://pith.science/pith/GZJPF47WITQTVEJSITO3CZKPRV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZJPF47WITQTVEJSITO3CZKPRV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:GZJPF47WITQTVEJSITO3CZKPRV","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":"ef82253febebf5d423ce3f600fde0c3d1c5dbcc58d21e5ed0a1f1dbf9b289f7f","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-17T16:31:29Z","title_canon_sha256":"55284b3e0592a68b045fc03d549ad1bbb415e00d771291e388781532acf2a761"},"schema_version":"1.0","source":{"id":"2103.09762","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.09762","created_at":"2026-07-05T02:24:07Z"},{"alias_kind":"arxiv_version","alias_value":"2103.09762v1","created_at":"2026-07-05T02:24:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.09762","created_at":"2026-07-05T02:24:07Z"},{"alias_kind":"pith_short_12","alias_value":"GZJPF47WITQT","created_at":"2026-07-05T02:24:07Z"},{"alias_kind":"pith_short_16","alias_value":"GZJPF47WITQTVEJS","created_at":"2026-07-05T02:24:07Z"},{"alias_kind":"pith_short_8","alias_value":"GZJPF47W","created_at":"2026-07-05T02:24:07Z"}],"graph_snapshots":[{"event_id":"sha256:f1badc160e342e61ced8bb03e071f5618b5faa1e1672a9f86e48e10c7b994ded","target":"graph","created_at":"2026-07-05T02:24: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2103.09762/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The ability to learn continually without forgetting the past tasks is a desired attribute for artificial learning systems. Existing approaches to enable such learning in artificial neural networks usually rely on network growth, importance based weight update or replay of old data from the memory. In contrast, we propose a novel approach where a neural network learns new tasks by taking gradient steps in the orthogonal direction to the gradient subspaces deemed important for the past tasks. We find the bases of these subspaces by analyzing network representations (activations) after learning e","authors_text":"Gobinda Saha, Isha Garg, Kaushik Roy","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-17T16:31:29Z","title":"Gradient Projection Memory for Continual Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.09762","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:098a87d3a6cf536b346cfae9f1af37d4c19390bb0a96ad67bda0ee3c48eff287","target":"record","created_at":"2026-07-05T02:24: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":"ef82253febebf5d423ce3f600fde0c3d1c5dbcc58d21e5ed0a1f1dbf9b289f7f","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-17T16:31:29Z","title_canon_sha256":"55284b3e0592a68b045fc03d549ad1bbb415e00d771291e388781532acf2a761"},"schema_version":"1.0","source":{"id":"2103.09762","kind":"arxiv","version":1}},"canonical_sha256":"3652f2f3f644e13a913244ddb1654f8d7f2e4c28eda926db3f16cc4be2853a66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3652f2f3f644e13a913244ddb1654f8d7f2e4c28eda926db3f16cc4be2853a66","first_computed_at":"2026-07-05T02:24:07.121740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:24:07.121740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p7ZCa+TFQDWWrwi8lLmAdo/eqqkCUIvyX7266eB9Q7JjFjYqt9oeMPGUalXB0jH68X0j5TLLLGYYaCGD6xwnDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:24:07.122146Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.09762","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:098a87d3a6cf536b346cfae9f1af37d4c19390bb0a96ad67bda0ee3c48eff287","sha256:f1badc160e342e61ced8bb03e071f5618b5faa1e1672a9f86e48e10c7b994ded"],"state_sha256":"45d716f70cc0cf08dba1ffdbad79f15155317488ad8a208abee92c118c22f7e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VKOpeIttFvzn63LYuSp6hR8UX3EcLx2fSCBNLoYMi+5vZE/deYk5ASRFQRI5mPylFmowAE90p/DLu6oW1RpmDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T08:58:38.625960Z","bundle_sha256":"1335eae4362e901b744fba05db6d1558ad81ae2caf4ac16e090e835d61bb5ca7"}}