{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PMK7AULX64LLCW6WWS3U27I3VE","short_pith_number":"pith:PMK7AULX","canonical_record":{"source":{"id":"1907.07872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-18T04:51:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"475883844a05287dffd9d9680cd10cff1cc4440255c3745d5b5ada11097f6c94","abstract_canon_sha256":"6a208e0738cd7506f294bfb7aea20541b17135452b81e5e3144b5ba9017bada7"},"schema_version":"1.0"},"canonical_sha256":"7b15f05177f716b15bd6b4b74d7d1ba90c4559be4b232d06775cab5e2ac40566","source":{"kind":"arxiv","id":"1907.07872","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07872","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07872v1","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07872","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"PMK7AULX64LL","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PMK7AULX64LLCW6W","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PMK7AULX","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PMK7AULX64LLCW6WWS3U27I3VE","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-18T04:51:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"475883844a05287dffd9d9680cd10cff1cc4440255c3745d5b5ada11097f6c94","abstract_canon_sha256":"6a208e0738cd7506f294bfb7aea20541b17135452b81e5e3144b5ba9017bada7"},"schema_version":"1.0"},"canonical_sha256":"7b15f05177f716b15bd6b4b74d7d1ba90c4559be4b232d06775cab5e2ac40566","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:15.886994Z","signature_b64":"DjzRKyW76u06sgdGLIW4cdSvKp4VGSpw4ZylPQS8PK29USDlUPgsHibTco5cChW3GgxJpPS11ZBN+rt0xR4/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b15f05177f716b15bd6b4b74d7d1ba90c4559be4b232d06775cab5e2ac40566","last_reissued_at":"2026-05-17T23:40:15.886267Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:15.886267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07872","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-05-17T23:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NQIrFyMDHWsAWsv+iqARHGvm8PqKPGBjfxK7EB2/G/evc0Wh2ESA+GJ7WxTC/jYk7V0pnJjEczpB/fKTrDUgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:01:29.634471Z"},"content_sha256":"373d1275e5be20d8372ccb951ada18b9219a929bc2dd65bbe5d12a808b1b9358","schema_version":"1.0","event_id":"sha256:373d1275e5be20d8372ccb951ada18b9219a929bc2dd65bbe5d12a808b1b9358"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PMK7AULX64LLCW6WWS3U27I3VE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Autoencoder-Based Incremental Class Learning without Retraining on Old Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Euntae Choi, Kiyoung Choi, Kyungmi Lee","submitted_at":"2019-07-18T04:51:25Z","abstract_excerpt":"Incremental class learning, a scenario in continual learning context where classes and their training data are sequentially and disjointedly observed, challenges a problem widely known as catastrophic forgetting. In this work, we propose a novel incremental class learning method that can significantly reduce memory overhead compared to previous approaches. Apart from conventional classification scheme using softmax, our model bases on an autoencoder to extract prototypes for given inputs so that no change in its output unit is required. It stores only the mean of prototypes per class to perfor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07872","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":""},"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-05-17T23:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M5opoW0RZyp/32SuI3G41ZaJ9utGjEiYeAL/ZFHYfYkBww8719n5hh7haYnkveGjd2ACOB6A41PEGvFmKbCWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:01:29.634853Z"},"content_sha256":"7331c1c7c10bd79d33af12d673f459efdc684eab66f17d3b4da4bf1f95a72e3d","schema_version":"1.0","event_id":"sha256:7331c1c7c10bd79d33af12d673f459efdc684eab66f17d3b4da4bf1f95a72e3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PMK7AULX64LLCW6WWS3U27I3VE/bundle.json","state_url":"https://pith.science/pith/PMK7AULX64LLCW6WWS3U27I3VE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PMK7AULX64LLCW6WWS3U27I3VE/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-05-26T20:01:29Z","links":{"resolver":"https://pith.science/pith/PMK7AULX64LLCW6WWS3U27I3VE","bundle":"https://pith.science/pith/PMK7AULX64LLCW6WWS3U27I3VE/bundle.json","state":"https://pith.science/pith/PMK7AULX64LLCW6WWS3U27I3VE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PMK7AULX64LLCW6WWS3U27I3VE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PMK7AULX64LLCW6WWS3U27I3VE","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":"6a208e0738cd7506f294bfb7aea20541b17135452b81e5e3144b5ba9017bada7","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-18T04:51:25Z","title_canon_sha256":"475883844a05287dffd9d9680cd10cff1cc4440255c3745d5b5ada11097f6c94"},"schema_version":"1.0","source":{"id":"1907.07872","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07872","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07872v1","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07872","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"PMK7AULX64LL","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PMK7AULX64LLCW6W","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PMK7AULX","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:7331c1c7c10bd79d33af12d673f459efdc684eab66f17d3b4da4bf1f95a72e3d","target":"graph","created_at":"2026-05-17T23:40:15Z","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"},"paper":{"abstract_excerpt":"Incremental class learning, a scenario in continual learning context where classes and their training data are sequentially and disjointedly observed, challenges a problem widely known as catastrophic forgetting. In this work, we propose a novel incremental class learning method that can significantly reduce memory overhead compared to previous approaches. Apart from conventional classification scheme using softmax, our model bases on an autoencoder to extract prototypes for given inputs so that no change in its output unit is required. It stores only the mean of prototypes per class to perfor","authors_text":"Euntae Choi, Kiyoung Choi, Kyungmi Lee","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-18T04:51:25Z","title":"Autoencoder-Based Incremental Class Learning without Retraining on Old Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07872","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:373d1275e5be20d8372ccb951ada18b9219a929bc2dd65bbe5d12a808b1b9358","target":"record","created_at":"2026-05-17T23:40:15Z","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":"6a208e0738cd7506f294bfb7aea20541b17135452b81e5e3144b5ba9017bada7","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-18T04:51:25Z","title_canon_sha256":"475883844a05287dffd9d9680cd10cff1cc4440255c3745d5b5ada11097f6c94"},"schema_version":"1.0","source":{"id":"1907.07872","kind":"arxiv","version":1}},"canonical_sha256":"7b15f05177f716b15bd6b4b74d7d1ba90c4559be4b232d06775cab5e2ac40566","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b15f05177f716b15bd6b4b74d7d1ba90c4559be4b232d06775cab5e2ac40566","first_computed_at":"2026-05-17T23:40:15.886267Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:15.886267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DjzRKyW76u06sgdGLIW4cdSvKp4VGSpw4ZylPQS8PK29USDlUPgsHibTco5cChW3GgxJpPS11ZBN+rt0xR4/AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:15.886994Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07872","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:373d1275e5be20d8372ccb951ada18b9219a929bc2dd65bbe5d12a808b1b9358","sha256:7331c1c7c10bd79d33af12d673f459efdc684eab66f17d3b4da4bf1f95a72e3d"],"state_sha256":"93eff3dfe3ed6e0a2f6e1750892f3b9e939fc0ece75eb8ddbc08ecfee3099511"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+5TRwRf4CMp11pPauBnFoYwGoDnBDUymXA5jKEi6nI0hxhFayOLGdR2HbaLAE1jf8AFAArwLRuh0/y5FcRikAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:01:29.638779Z","bundle_sha256":"2fc58d36ddc3343c67d1946c360b60952840fb7ca568463a900688e28ea3d5ae"}}