{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BKAD2X4UCVQGDXT64GZPA7Y7NT","short_pith_number":"pith:BKAD2X4U","canonical_record":{"source":{"id":"1905.07835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T01:10:34Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"69fc386ef8f7d26f57f655fece0e0dffacf11c333bd2eb29f03b6952341e8265","abstract_canon_sha256":"548cd44c747eb66e2f13717ce380e0c554a7f6184740ae0a2850c2ca4fdef21b"},"schema_version":"1.0"},"canonical_sha256":"0a803d5f94156061de7ee1b2f07f1f6cfe9cc77a81db03ec32f5bd94ab39df01","source":{"kind":"arxiv","id":"1905.07835","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07835","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07835v1","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07835","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"pith_short_12","alias_value":"BKAD2X4UCVQG","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BKAD2X4UCVQGDXT6","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BKAD2X4U","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BKAD2X4UCVQGDXT64GZPA7Y7NT","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T01:10:34Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"69fc386ef8f7d26f57f655fece0e0dffacf11c333bd2eb29f03b6952341e8265","abstract_canon_sha256":"548cd44c747eb66e2f13717ce380e0c554a7f6184740ae0a2850c2ca4fdef21b"},"schema_version":"1.0"},"canonical_sha256":"0a803d5f94156061de7ee1b2f07f1f6cfe9cc77a81db03ec32f5bd94ab39df01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:48.383051Z","signature_b64":"AXnGVHN3rU8ZySqJTAoer9Z3NCavOrLbex5IYapM8sykWOBT3XPEx1RmD5pFKW94urjvWfz6Y4m+15k3ztelDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a803d5f94156061de7ee1b2f07f1f6cfe9cc77a81db03ec32f5bd94ab39df01","last_reissued_at":"2026-05-17T23:45:48.382622Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:48.382622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07835","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:45:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zqg39XAfQRARaMhbPAikJXyRU4AjJOixgnzadcRX2xJ7E6GdeOvIyomurbwqtITsaJ0n94KuXUwL+aivdxlXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T17:25:15.762976Z"},"content_sha256":"1e5eb93fd609a204686cbad87116f5189b57891bebbc0d87ce98b10178bad2f6","schema_version":"1.0","event_id":"sha256:1e5eb93fd609a204686cbad87116f5189b57891bebbc0d87ce98b10178bad2f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BKAD2X4UCVQGDXT64GZPA7Y7NT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Label Mapping Neural Networks with Response Consolidation for Class Incremental Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Baile Xu, Furao Shen, Jian Zhao, Lekun Mao, Qingwei Lin, Xu Zhang, Yang Yao","submitted_at":"2019-05-20T01:10:34Z","abstract_excerpt":"Class incremental learning refers to a special multi-class classification task, in which the number of classes is not fixed but is increasing with the continual arrival of new data. Existing researches mainly focused on solving catastrophic forgetting problem in class incremental learning. To this end, however, these models still require the old classes cached in the auxiliary data structure or models, which is inefficient in space or time. In this paper, it is the first time to discuss the difficulty without support of old classes in class incremental learning, which is called as softmax supp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07835","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:45:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wX6qTpyDeIpFpszIztwLGQUfM8JCgrtix/Duirn4Em1TjvFgRrnWJYMzPjDYidYt1bUtjBaAac/CHNWsoCbHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T17:25:15.763371Z"},"content_sha256":"0bb72cfbc882ebb27acc615abb4c8ed3311987496cb6527afbfd922b66c1d6ed","schema_version":"1.0","event_id":"sha256:0bb72cfbc882ebb27acc615abb4c8ed3311987496cb6527afbfd922b66c1d6ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BKAD2X4UCVQGDXT64GZPA7Y7NT/bundle.json","state_url":"https://pith.science/pith/BKAD2X4UCVQGDXT64GZPA7Y7NT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BKAD2X4UCVQGDXT64GZPA7Y7NT/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-18T17:25:15Z","links":{"resolver":"https://pith.science/pith/BKAD2X4UCVQGDXT64GZPA7Y7NT","bundle":"https://pith.science/pith/BKAD2X4UCVQGDXT64GZPA7Y7NT/bundle.json","state":"https://pith.science/pith/BKAD2X4UCVQGDXT64GZPA7Y7NT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BKAD2X4UCVQGDXT64GZPA7Y7NT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BKAD2X4UCVQGDXT64GZPA7Y7NT","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":"548cd44c747eb66e2f13717ce380e0c554a7f6184740ae0a2850c2ca4fdef21b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T01:10:34Z","title_canon_sha256":"69fc386ef8f7d26f57f655fece0e0dffacf11c333bd2eb29f03b6952341e8265"},"schema_version":"1.0","source":{"id":"1905.07835","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07835","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07835v1","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07835","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"pith_short_12","alias_value":"BKAD2X4UCVQG","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BKAD2X4UCVQGDXT6","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BKAD2X4U","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:0bb72cfbc882ebb27acc615abb4c8ed3311987496cb6527afbfd922b66c1d6ed","target":"graph","created_at":"2026-05-17T23:45:48Z","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":"Class incremental learning refers to a special multi-class classification task, in which the number of classes is not fixed but is increasing with the continual arrival of new data. Existing researches mainly focused on solving catastrophic forgetting problem in class incremental learning. To this end, however, these models still require the old classes cached in the auxiliary data structure or models, which is inefficient in space or time. In this paper, it is the first time to discuss the difficulty without support of old classes in class incremental learning, which is called as softmax supp","authors_text":"Baile Xu, Furao Shen, Jian Zhao, Lekun Mao, Qingwei Lin, Xu Zhang, Yang Yao","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T01:10:34Z","title":"Label Mapping Neural Networks with Response Consolidation for Class Incremental Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07835","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:1e5eb93fd609a204686cbad87116f5189b57891bebbc0d87ce98b10178bad2f6","target":"record","created_at":"2026-05-17T23:45:48Z","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":"548cd44c747eb66e2f13717ce380e0c554a7f6184740ae0a2850c2ca4fdef21b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T01:10:34Z","title_canon_sha256":"69fc386ef8f7d26f57f655fece0e0dffacf11c333bd2eb29f03b6952341e8265"},"schema_version":"1.0","source":{"id":"1905.07835","kind":"arxiv","version":1}},"canonical_sha256":"0a803d5f94156061de7ee1b2f07f1f6cfe9cc77a81db03ec32f5bd94ab39df01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a803d5f94156061de7ee1b2f07f1f6cfe9cc77a81db03ec32f5bd94ab39df01","first_computed_at":"2026-05-17T23:45:48.382622Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:48.382622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AXnGVHN3rU8ZySqJTAoer9Z3NCavOrLbex5IYapM8sykWOBT3XPEx1RmD5pFKW94urjvWfz6Y4m+15k3ztelDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:48.383051Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07835","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e5eb93fd609a204686cbad87116f5189b57891bebbc0d87ce98b10178bad2f6","sha256:0bb72cfbc882ebb27acc615abb4c8ed3311987496cb6527afbfd922b66c1d6ed"],"state_sha256":"53ce995582e8018ded97a015fea52a4f508f05498ddcfb2d1fd4493202c156f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zpwm+6RDWT5+6qo8MOgjsJWtAK9o8hlygP48Z9Zb1CPhcrBWasDkWs3mwprV6XE/VEDvS8IN2SWJOWlFfcCXAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T17:25:15.764508Z","bundle_sha256":"f8c405d8204cee7e2d7987181d33ecd33fc0af39d43b9c4ff253f8119232b544"}}