{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5K3HVJBX6BLAO7CXHSGPI5653M","short_pith_number":"pith:5K3HVJBX","canonical_record":{"source":{"id":"1803.10232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-27T16:05:34Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3f08d78bc06a81328a9a3f6d374845ceaeb33105b58e1274f17a9d6d1ddf06ac","abstract_canon_sha256":"14756b9553033876a3eb2987269175f216f01ed7b77f347f1d3e5b70d446ec4b"},"schema_version":"1.0"},"canonical_sha256":"eab67aa437f056077c573c8cf477dddb39adc6524daf0bba9406acf1906c2098","source":{"kind":"arxiv","id":"1803.10232","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10232","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10232v1","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10232","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"5K3HVJBX6BLA","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5K3HVJBX6BLAO7CX","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5K3HVJBX","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5K3HVJBX6BLAO7CXHSGPI5653M","target":"record","payload":{"canonical_record":{"source":{"id":"1803.10232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-27T16:05:34Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3f08d78bc06a81328a9a3f6d374845ceaeb33105b58e1274f17a9d6d1ddf06ac","abstract_canon_sha256":"14756b9553033876a3eb2987269175f216f01ed7b77f347f1d3e5b70d446ec4b"},"schema_version":"1.0"},"canonical_sha256":"eab67aa437f056077c573c8cf477dddb39adc6524daf0bba9406acf1906c2098","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:56.038644Z","signature_b64":"AMDzbIaYqw4RFNk7vWb34n430UK+KP5oNXdGN82ariM6Z0ka7tuCpgiufDq8oupgdRZMw9s3inO59DVsu76vBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eab67aa437f056077c573c8cf477dddb39adc6524daf0bba9406acf1906c2098","last_reissued_at":"2026-05-18T00:19:56.037936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:56.037936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.10232","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-18T00:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"naK3OwcpaHsQu6UA7TkoSrKvS7JqFeTay/WfrngnQ73zhlcdWSpwDbIB+BsythtFyQhE1lrqNURvnsZH/KBUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:39:33.788814Z"},"content_sha256":"59237ceacc040b9e7d6c3749f4cc070a4f7dfc5422590f35ee0ebfe143fa7bd8","schema_version":"1.0","event_id":"sha256:59237ceacc040b9e7d6c3749f4cc070a4f7dfc5422590f35ee0ebfe143fa7bd8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5K3HVJBX6BLAO7CXHSGPI5653M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental Training of Deep Convolutional Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Adelmo Cristiano Innocenza Malossi, Costas Bekas, Dimitrios Nikolopoulos, Roxana Istrate","submitted_at":"2018-03-27T16:05:34Z","abstract_excerpt":"We propose an incremental training method that partitions the original network into sub-networks, which are then gradually incorporated in the running network during the training process. To allow for a smooth dynamic growth of the network, we introduce a look-ahead initialization that outperforms the random initialization. We demonstrate that our incremental approach reaches the reference network baseline accuracy. Additionally, it allows to identify smaller partitions of the original state-of-the-art network, that deliver the same final accuracy, by using only a fraction of the global number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10232","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-18T00:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"leEIl3M83MFXlScV3D/+trYZfLEkVKRzBoaF/BTmR9Fyfo/hXPOsW5w5001Gih4doVzkREYGy7LlGjBuH502Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:39:33.789171Z"},"content_sha256":"a0517afd60003187ea9bd2af9d6589514104a024d51f4d4f0ce18edce38c35c6","schema_version":"1.0","event_id":"sha256:a0517afd60003187ea9bd2af9d6589514104a024d51f4d4f0ce18edce38c35c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5K3HVJBX6BLAO7CXHSGPI5653M/bundle.json","state_url":"https://pith.science/pith/5K3HVJBX6BLAO7CXHSGPI5653M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5K3HVJBX6BLAO7CXHSGPI5653M/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-06-26T02:39:33Z","links":{"resolver":"https://pith.science/pith/5K3HVJBX6BLAO7CXHSGPI5653M","bundle":"https://pith.science/pith/5K3HVJBX6BLAO7CXHSGPI5653M/bundle.json","state":"https://pith.science/pith/5K3HVJBX6BLAO7CXHSGPI5653M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5K3HVJBX6BLAO7CXHSGPI5653M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5K3HVJBX6BLAO7CXHSGPI5653M","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":"14756b9553033876a3eb2987269175f216f01ed7b77f347f1d3e5b70d446ec4b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-27T16:05:34Z","title_canon_sha256":"3f08d78bc06a81328a9a3f6d374845ceaeb33105b58e1274f17a9d6d1ddf06ac"},"schema_version":"1.0","source":{"id":"1803.10232","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10232","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10232v1","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10232","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"5K3HVJBX6BLA","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5K3HVJBX6BLAO7CX","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5K3HVJBX","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:a0517afd60003187ea9bd2af9d6589514104a024d51f4d4f0ce18edce38c35c6","target":"graph","created_at":"2026-05-18T00:19:56Z","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":"We propose an incremental training method that partitions the original network into sub-networks, which are then gradually incorporated in the running network during the training process. To allow for a smooth dynamic growth of the network, we introduce a look-ahead initialization that outperforms the random initialization. We demonstrate that our incremental approach reaches the reference network baseline accuracy. Additionally, it allows to identify smaller partitions of the original state-of-the-art network, that deliver the same final accuracy, by using only a fraction of the global number","authors_text":"Adelmo Cristiano Innocenza Malossi, Costas Bekas, Dimitrios Nikolopoulos, Roxana Istrate","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-27T16:05:34Z","title":"Incremental Training of Deep Convolutional Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10232","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:59237ceacc040b9e7d6c3749f4cc070a4f7dfc5422590f35ee0ebfe143fa7bd8","target":"record","created_at":"2026-05-18T00:19:56Z","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":"14756b9553033876a3eb2987269175f216f01ed7b77f347f1d3e5b70d446ec4b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-27T16:05:34Z","title_canon_sha256":"3f08d78bc06a81328a9a3f6d374845ceaeb33105b58e1274f17a9d6d1ddf06ac"},"schema_version":"1.0","source":{"id":"1803.10232","kind":"arxiv","version":1}},"canonical_sha256":"eab67aa437f056077c573c8cf477dddb39adc6524daf0bba9406acf1906c2098","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eab67aa437f056077c573c8cf477dddb39adc6524daf0bba9406acf1906c2098","first_computed_at":"2026-05-18T00:19:56.037936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:56.037936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AMDzbIaYqw4RFNk7vWb34n430UK+KP5oNXdGN82ariM6Z0ka7tuCpgiufDq8oupgdRZMw9s3inO59DVsu76vBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:56.038644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.10232","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59237ceacc040b9e7d6c3749f4cc070a4f7dfc5422590f35ee0ebfe143fa7bd8","sha256:a0517afd60003187ea9bd2af9d6589514104a024d51f4d4f0ce18edce38c35c6"],"state_sha256":"7cdf24f0fe0edc6eff099d6a14240a02af911f02ba4d8c220a2dcd74e87d5412"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q3m1HU5cuM2K5vAdq4uVxWsUrWKO8sBj9k3Vus4x3PPXcBtMun1vl2f9LS7qN3D8WB0/jrbdu0UgJbXw4WWMBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T02:39:33.791191Z","bundle_sha256":"a4aa24c95f0bb18813b90c2df268d05dd0d0d2b383bc6934a36d87ab773583e7"}}