{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6JV6GDAG4WYGABZ7TP47UZMPXP","short_pith_number":"pith:6JV6GDAG","canonical_record":{"source":{"id":"1906.04734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T04:23:14Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"24e46f046ff63821fcf90a304550d65790595f6b8c66b0906c74890af694fede","abstract_canon_sha256":"6a140169694fd0297eb5c949bc8b2a50e7487f8868b7b85fba5353cd0c8e4c16"},"schema_version":"1.0"},"canonical_sha256":"f26be30c06e5b060073f9bf9fa658fbbd3e9d82ca5bf1fe46138847e5b2a407a","source":{"kind":"arxiv","id":"1906.04734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04734","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04734v1","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04734","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"pith_short_12","alias_value":"6JV6GDAG4WYG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6JV6GDAG4WYGABZ7","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6JV6GDAG","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6JV6GDAG4WYGABZ7TP47UZMPXP","target":"record","payload":{"canonical_record":{"source":{"id":"1906.04734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T04:23:14Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"24e46f046ff63821fcf90a304550d65790595f6b8c66b0906c74890af694fede","abstract_canon_sha256":"6a140169694fd0297eb5c949bc8b2a50e7487f8868b7b85fba5353cd0c8e4c16"},"schema_version":"1.0"},"canonical_sha256":"f26be30c06e5b060073f9bf9fa658fbbd3e9d82ca5bf1fe46138847e5b2a407a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:32.388679Z","signature_b64":"bd7GiPHsnLBHGqysmmRZI2cDYc8ElfY9+v1Vb2MIhnw/5vdJyHfKi+ct5czniPxURRGxQRmyLFPtxZWlORCxDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f26be30c06e5b060073f9bf9fa658fbbd3e9d82ca5bf1fe46138847e5b2a407a","last_reissued_at":"2026-05-17T23:43:32.388065Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:32.388065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.04734","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:43:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZSZO4UZAdBJ4bo2Y+/GYbTBUDHA4QSwLZjfyE9XZsxrxcmyDdGYlJqGEAQXTZUoY6EIqRyCxCdrvlzAj5C++Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:40:23.796761Z"},"content_sha256":"f86950efe6b26007e7c6a6c815e7f23fdd66a79930dd720ce3513fcf87c22544","schema_version":"1.0","event_id":"sha256:f86950efe6b26007e7c6a6c815e7f23fdd66a79930dd720ce3513fcf87c22544"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6JV6GDAG4WYGABZ7TP47UZMPXP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental Classifier Learning Based on PEDCC-Loss and Cosine Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Qiuyu Zhu, Xin Ye, Zikuang He","submitted_at":"2019-06-11T04:23:14Z","abstract_excerpt":"The main purpose of incremental learning is to learn new knowledge while not forgetting the knowledge which have been learned before. At present, the main challenge in this area is the catastrophe forgetting, namely the network will lose their performance in the old tasks after training for new tasks. In this paper, we introduce an ensemble method of incremental classifier to alleviate this problem, which is based on the cosine distance between the output feature and the pre-defined center, and can let each task to be preserved in different networks. During training, we make use of PEDCC-Loss "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04734","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:43:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8aEnm5b9hPEVzRDTSQgRUAmCyLSEcVVT3xTtmJg5wgL6Ib+3ynI7LMVKXlH9gz1I0BT0zrJc7caqIMu3eBrCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:40:23.797434Z"},"content_sha256":"f446a3b3a47f62ad86987c39ffa633e7c5eae7e70e8c960c3a6f741e34d75dac","schema_version":"1.0","event_id":"sha256:f446a3b3a47f62ad86987c39ffa633e7c5eae7e70e8c960c3a6f741e34d75dac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JV6GDAG4WYGABZ7TP47UZMPXP/bundle.json","state_url":"https://pith.science/pith/6JV6GDAG4WYGABZ7TP47UZMPXP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JV6GDAG4WYGABZ7TP47UZMPXP/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-26T16:40:23Z","links":{"resolver":"https://pith.science/pith/6JV6GDAG4WYGABZ7TP47UZMPXP","bundle":"https://pith.science/pith/6JV6GDAG4WYGABZ7TP47UZMPXP/bundle.json","state":"https://pith.science/pith/6JV6GDAG4WYGABZ7TP47UZMPXP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JV6GDAG4WYGABZ7TP47UZMPXP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6JV6GDAG4WYGABZ7TP47UZMPXP","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":"6a140169694fd0297eb5c949bc8b2a50e7487f8868b7b85fba5353cd0c8e4c16","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T04:23:14Z","title_canon_sha256":"24e46f046ff63821fcf90a304550d65790595f6b8c66b0906c74890af694fede"},"schema_version":"1.0","source":{"id":"1906.04734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04734","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04734v1","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04734","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"pith_short_12","alias_value":"6JV6GDAG4WYG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6JV6GDAG4WYGABZ7","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6JV6GDAG","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:f446a3b3a47f62ad86987c39ffa633e7c5eae7e70e8c960c3a6f741e34d75dac","target":"graph","created_at":"2026-05-17T23:43:32Z","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":"The main purpose of incremental learning is to learn new knowledge while not forgetting the knowledge which have been learned before. At present, the main challenge in this area is the catastrophe forgetting, namely the network will lose their performance in the old tasks after training for new tasks. In this paper, we introduce an ensemble method of incremental classifier to alleviate this problem, which is based on the cosine distance between the output feature and the pre-defined center, and can let each task to be preserved in different networks. During training, we make use of PEDCC-Loss ","authors_text":"Qiuyu Zhu, Xin Ye, Zikuang He","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T04:23:14Z","title":"Incremental Classifier Learning Based on PEDCC-Loss and Cosine Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04734","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:f86950efe6b26007e7c6a6c815e7f23fdd66a79930dd720ce3513fcf87c22544","target":"record","created_at":"2026-05-17T23:43:32Z","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":"6a140169694fd0297eb5c949bc8b2a50e7487f8868b7b85fba5353cd0c8e4c16","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T04:23:14Z","title_canon_sha256":"24e46f046ff63821fcf90a304550d65790595f6b8c66b0906c74890af694fede"},"schema_version":"1.0","source":{"id":"1906.04734","kind":"arxiv","version":1}},"canonical_sha256":"f26be30c06e5b060073f9bf9fa658fbbd3e9d82ca5bf1fe46138847e5b2a407a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f26be30c06e5b060073f9bf9fa658fbbd3e9d82ca5bf1fe46138847e5b2a407a","first_computed_at":"2026-05-17T23:43:32.388065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:32.388065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bd7GiPHsnLBHGqysmmRZI2cDYc8ElfY9+v1Vb2MIhnw/5vdJyHfKi+ct5czniPxURRGxQRmyLFPtxZWlORCxDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:32.388679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.04734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f86950efe6b26007e7c6a6c815e7f23fdd66a79930dd720ce3513fcf87c22544","sha256:f446a3b3a47f62ad86987c39ffa633e7c5eae7e70e8c960c3a6f741e34d75dac"],"state_sha256":"4709ba3202365c5b623d9430fe2467dacb3d347f96d29141ac3a91feab270dcc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YYeYAwI2QdMepC1204iOeOKIj1XUP2WWOymPnaQGLP6ykxGPJhByyIeTA4UgGw2y3h4DLtQFiOuKaNZwK4/8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:40:23.801197Z","bundle_sha256":"c0cf5726a851dbb26308b38c12a53fd5869bddd88941bdfec4b0a23ff62a92c4"}}