{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:P2FTRZ3VKH3LKO5TXCHKGQVA63","short_pith_number":"pith:P2FTRZ3V","canonical_record":{"source":{"id":"1802.05800","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-15T23:36:56Z","cross_cats_sorted":["cs.AI","eess.IV","stat.ML"],"title_canon_sha256":"3861c00058cdb3d68b4663053cba3c74b93deb60dc5c802045dc5ae96bbf2be3","abstract_canon_sha256":"9a729c1674db06da2224ff462d6f05759f660e95bbfaff91adb3a2c4ee4a36bd"},"schema_version":"1.0"},"canonical_sha256":"7e8b38e77551f6b53bb3b88ea342a0f6f125dc2d8cba1afd43853d1132f42dd0","source":{"kind":"arxiv","id":"1802.05800","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05800","created_at":"2026-07-05T00:02:53Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05800v3","created_at":"2026-07-05T00:02:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05800","created_at":"2026-07-05T00:02:53Z"},{"alias_kind":"pith_short_12","alias_value":"P2FTRZ3VKH3L","created_at":"2026-07-05T00:02:53Z"},{"alias_kind":"pith_short_16","alias_value":"P2FTRZ3VKH3LKO5T","created_at":"2026-07-05T00:02:53Z"},{"alias_kind":"pith_short_8","alias_value":"P2FTRZ3V","created_at":"2026-07-05T00:02:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:P2FTRZ3VKH3LKO5TXCHKGQVA63","target":"record","payload":{"canonical_record":{"source":{"id":"1802.05800","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-15T23:36:56Z","cross_cats_sorted":["cs.AI","eess.IV","stat.ML"],"title_canon_sha256":"3861c00058cdb3d68b4663053cba3c74b93deb60dc5c802045dc5ae96bbf2be3","abstract_canon_sha256":"9a729c1674db06da2224ff462d6f05759f660e95bbfaff91adb3a2c4ee4a36bd"},"schema_version":"1.0"},"canonical_sha256":"7e8b38e77551f6b53bb3b88ea342a0f6f125dc2d8cba1afd43853d1132f42dd0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:02:53.032750Z","signature_b64":"MrNHpgmQUGyF+b1g5zJ99VfFu/lOf7sSEJ4JAl6TkgohN1248andtwY6BpRCC077U+1BBwJGQQNTwwggrKH0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e8b38e77551f6b53bb3b88ea342a0f6f125dc2d8cba1afd43853d1132f42dd0","last_reissued_at":"2026-07-05T00:02:53.032370Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:02:53.032370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.05800","source_version":3,"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-05T00:02:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h62ebi9LSdnJrc8BGoR85D/qbC+Fk1seAR3VCPhjEN5AiRj2zWLTnlaIt0LtMY+hp2RpyiNrbQCzV4zNj1eUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T23:12:08.665190Z"},"content_sha256":"3dc95cec722b146493de7ff151a74ae3203ff456522cc4fe25f67ecf5438f3ad","schema_version":"1.0","event_id":"sha256:3dc95cec722b146493de7ff151a74ae3203ff456522cc4fe25f67ecf5438f3ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:P2FTRZ3VKH3LKO5TXCHKGQVA63","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree-CNN: A Hierarchical Deep Convolutional Neural Network for Incremental Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","eess.IV","stat.ML"],"primary_cat":"cs.CV","authors_text":"Deboleena Roy, Kaushik Roy, Priyadarshini Panda","submitted_at":"2018-02-15T23:36:56Z","abstract_excerpt":"Over the past decade, Deep Convolutional Neural Networks (DCNNs) have shown remarkable performance in most computer vision tasks. These tasks traditionally use a fixed dataset, and the model, once trained, is deployed as is. Adding new information to such a model presents a challenge due to complex training issues, such as \"catastrophic forgetting\", and sensitivity to hyper-parameter tuning. However, in this modern world, data is constantly evolving, and our deep learning models are required to adapt to these changes. In this paper, we propose an adaptive hierarchical network structure compose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05800","kind":"arxiv","version":3},"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/1802.05800/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-05T00:02:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5XnQIn7BbW4XcqwsTIUDa9l5TW6dtM/r2xeq/K2NN81eZrDgxdELyyLhV79wt2d7iFrVngWbDtmgolYwXl7DAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T23:12:08.666205Z"},"content_sha256":"01711bd33a50bb5ad97e69749f8ac013a34ec23ce4763199643fda88bd61bc65","schema_version":"1.0","event_id":"sha256:01711bd33a50bb5ad97e69749f8ac013a34ec23ce4763199643fda88bd61bc65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P2FTRZ3VKH3LKO5TXCHKGQVA63/bundle.json","state_url":"https://pith.science/pith/P2FTRZ3VKH3LKO5TXCHKGQVA63/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P2FTRZ3VKH3LKO5TXCHKGQVA63/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-17T23:12:08Z","links":{"resolver":"https://pith.science/pith/P2FTRZ3VKH3LKO5TXCHKGQVA63","bundle":"https://pith.science/pith/P2FTRZ3VKH3LKO5TXCHKGQVA63/bundle.json","state":"https://pith.science/pith/P2FTRZ3VKH3LKO5TXCHKGQVA63/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P2FTRZ3VKH3LKO5TXCHKGQVA63/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:P2FTRZ3VKH3LKO5TXCHKGQVA63","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":"9a729c1674db06da2224ff462d6f05759f660e95bbfaff91adb3a2c4ee4a36bd","cross_cats_sorted":["cs.AI","eess.IV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-15T23:36:56Z","title_canon_sha256":"3861c00058cdb3d68b4663053cba3c74b93deb60dc5c802045dc5ae96bbf2be3"},"schema_version":"1.0","source":{"id":"1802.05800","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05800","created_at":"2026-07-05T00:02:53Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05800v3","created_at":"2026-07-05T00:02:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05800","created_at":"2026-07-05T00:02:53Z"},{"alias_kind":"pith_short_12","alias_value":"P2FTRZ3VKH3L","created_at":"2026-07-05T00:02:53Z"},{"alias_kind":"pith_short_16","alias_value":"P2FTRZ3VKH3LKO5T","created_at":"2026-07-05T00:02:53Z"},{"alias_kind":"pith_short_8","alias_value":"P2FTRZ3V","created_at":"2026-07-05T00:02:53Z"}],"graph_snapshots":[{"event_id":"sha256:01711bd33a50bb5ad97e69749f8ac013a34ec23ce4763199643fda88bd61bc65","target":"graph","created_at":"2026-07-05T00:02:53Z","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/1802.05800/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Over the past decade, Deep Convolutional Neural Networks (DCNNs) have shown remarkable performance in most computer vision tasks. These tasks traditionally use a fixed dataset, and the model, once trained, is deployed as is. Adding new information to such a model presents a challenge due to complex training issues, such as \"catastrophic forgetting\", and sensitivity to hyper-parameter tuning. However, in this modern world, data is constantly evolving, and our deep learning models are required to adapt to these changes. In this paper, we propose an adaptive hierarchical network structure compose","authors_text":"Deboleena Roy, Kaushik Roy, Priyadarshini Panda","cross_cats":["cs.AI","eess.IV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-15T23:36:56Z","title":"Tree-CNN: A Hierarchical Deep Convolutional Neural Network for Incremental Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05800","kind":"arxiv","version":3},"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:3dc95cec722b146493de7ff151a74ae3203ff456522cc4fe25f67ecf5438f3ad","target":"record","created_at":"2026-07-05T00:02:53Z","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":"9a729c1674db06da2224ff462d6f05759f660e95bbfaff91adb3a2c4ee4a36bd","cross_cats_sorted":["cs.AI","eess.IV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-15T23:36:56Z","title_canon_sha256":"3861c00058cdb3d68b4663053cba3c74b93deb60dc5c802045dc5ae96bbf2be3"},"schema_version":"1.0","source":{"id":"1802.05800","kind":"arxiv","version":3}},"canonical_sha256":"7e8b38e77551f6b53bb3b88ea342a0f6f125dc2d8cba1afd43853d1132f42dd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e8b38e77551f6b53bb3b88ea342a0f6f125dc2d8cba1afd43853d1132f42dd0","first_computed_at":"2026-07-05T00:02:53.032370Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:02:53.032370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MrNHpgmQUGyF+b1g5zJ99VfFu/lOf7sSEJ4JAl6TkgohN1248andtwY6BpRCC077U+1BBwJGQQNTwwggrKH0CA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:02:53.032750Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05800","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3dc95cec722b146493de7ff151a74ae3203ff456522cc4fe25f67ecf5438f3ad","sha256:01711bd33a50bb5ad97e69749f8ac013a34ec23ce4763199643fda88bd61bc65"],"state_sha256":"c14b72d8421ca0fcc6873c168f9fa665b5fe09851a3ce98e704b6fb952b09715"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nHcqJXQYYZFWKyDWwG9k8bn2SH0L6APi2rDdvt70S335MlQSq8d32eaQCPDmjw+R0nBiwuoShzPiETm5cSlTDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T23:12:08.673504Z","bundle_sha256":"fdbb4608e4f236ab6e816db829433c5643c7d5da6698593aa6f285aa55635d07"}}