{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:N5R2RICGYBXC2NV6PFNPVYIHBC","short_pith_number":"pith:N5R2RICG","canonical_record":{"source":{"id":"2002.07141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-17T18:57:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"950c5d183a03fcbbb042ce8ece5ece9c62601a29b9e8fbd852f2371427261b9d","abstract_canon_sha256":"a2224045adca8280aa7295941ba7b3d8facd36ac10995f6aa0c8616121d9a490"},"schema_version":"1.0"},"canonical_sha256":"6f63a8a046c06e2d36be795afae10708a38a9a1e1fe11354f102adbd682a99a7","source":{"kind":"arxiv","id":"2002.07141","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.07141","created_at":"2026-07-05T01:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"2002.07141v2","created_at":"2026-07-05T01:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.07141","created_at":"2026-07-05T01:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"N5R2RICGYBXC","created_at":"2026-07-05T01:05:26Z"},{"alias_kind":"pith_short_16","alias_value":"N5R2RICGYBXC2NV6","created_at":"2026-07-05T01:05:26Z"},{"alias_kind":"pith_short_8","alias_value":"N5R2RICG","created_at":"2026-07-05T01:05:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:N5R2RICGYBXC2NV6PFNPVYIHBC","target":"record","payload":{"canonical_record":{"source":{"id":"2002.07141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-17T18:57:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"950c5d183a03fcbbb042ce8ece5ece9c62601a29b9e8fbd852f2371427261b9d","abstract_canon_sha256":"a2224045adca8280aa7295941ba7b3d8facd36ac10995f6aa0c8616121d9a490"},"schema_version":"1.0"},"canonical_sha256":"6f63a8a046c06e2d36be795afae10708a38a9a1e1fe11354f102adbd682a99a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:05:26.251490Z","signature_b64":"PN1rXwQVC5fVwjlpavKsPEm+shKpQ6VHIBJaUI2zw7dsG6EOAZYTR3eFIsFq9dlaGfhrzKdOvI7wOzhb7MxFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f63a8a046c06e2d36be795afae10708a38a9a1e1fe11354f102adbd682a99a7","last_reissued_at":"2026-07-05T01:05:26.251002Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:05:26.251002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.07141","source_version":2,"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-05T01:05:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6n7X6WF2OzD5UuyvpKq0JFntnJ2rF8NFZbVS2gKa0WQL2ARvqr7YzAu6rYlAbv5R2GAz19is0/YSQnoxIEHLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:02:19.990827Z"},"content_sha256":"34ddbbc9d1468e18ce718fab362d0b960a39be73d84419283c5c9990ae9b495c","schema_version":"1.0","event_id":"sha256:34ddbbc9d1468e18ce718fab362d0b960a39be73d84419283c5c9990ae9b495c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:N5R2RICGYBXC2NV6PFNPVYIHBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subset Sampling For Progressive Neural Network Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandros Iosifidis, Dat Thanh Tran, Moncef Gabbouj","submitted_at":"2020-02-17T18:57:33Z","abstract_excerpt":"Progressive Neural Network Learning is a class of algorithms that incrementally construct the network's topology and optimize its parameters based on the training data. While this approach exempts the users from the manual task of designing and validating multiple network topologies, it often requires an enormous number of computations. In this paper, we propose to speed up this process by exploiting subsets of training data at each incremental training step. Three different sampling strategies for selecting the training samples according to different criteria are proposed and evaluated. We al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.07141","kind":"arxiv","version":2},"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/2002.07141/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-05T01:05:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dCwev9EYZ1of4OAwhesKnlD9PhVUvWtBrdf5GWWDkl8xaPNoWPXC4MvPeAiMwljcHM6AfI9BwxmZWYP+pzk7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:02:19.991198Z"},"content_sha256":"100c87f0302e5f11b30157489def11bf8cc5ab4c5b3cc7c239215f3adc2f0c8a","schema_version":"1.0","event_id":"sha256:100c87f0302e5f11b30157489def11bf8cc5ab4c5b3cc7c239215f3adc2f0c8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N5R2RICGYBXC2NV6PFNPVYIHBC/bundle.json","state_url":"https://pith.science/pith/N5R2RICGYBXC2NV6PFNPVYIHBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N5R2RICGYBXC2NV6PFNPVYIHBC/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-07-07T08:02:19Z","links":{"resolver":"https://pith.science/pith/N5R2RICGYBXC2NV6PFNPVYIHBC","bundle":"https://pith.science/pith/N5R2RICGYBXC2NV6PFNPVYIHBC/bundle.json","state":"https://pith.science/pith/N5R2RICGYBXC2NV6PFNPVYIHBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N5R2RICGYBXC2NV6PFNPVYIHBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:N5R2RICGYBXC2NV6PFNPVYIHBC","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":"a2224045adca8280aa7295941ba7b3d8facd36ac10995f6aa0c8616121d9a490","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-17T18:57:33Z","title_canon_sha256":"950c5d183a03fcbbb042ce8ece5ece9c62601a29b9e8fbd852f2371427261b9d"},"schema_version":"1.0","source":{"id":"2002.07141","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.07141","created_at":"2026-07-05T01:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"2002.07141v2","created_at":"2026-07-05T01:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.07141","created_at":"2026-07-05T01:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"N5R2RICGYBXC","created_at":"2026-07-05T01:05:26Z"},{"alias_kind":"pith_short_16","alias_value":"N5R2RICGYBXC2NV6","created_at":"2026-07-05T01:05:26Z"},{"alias_kind":"pith_short_8","alias_value":"N5R2RICG","created_at":"2026-07-05T01:05:26Z"}],"graph_snapshots":[{"event_id":"sha256:100c87f0302e5f11b30157489def11bf8cc5ab4c5b3cc7c239215f3adc2f0c8a","target":"graph","created_at":"2026-07-05T01:05:26Z","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/2002.07141/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Progressive Neural Network Learning is a class of algorithms that incrementally construct the network's topology and optimize its parameters based on the training data. While this approach exempts the users from the manual task of designing and validating multiple network topologies, it often requires an enormous number of computations. In this paper, we propose to speed up this process by exploiting subsets of training data at each incremental training step. Three different sampling strategies for selecting the training samples according to different criteria are proposed and evaluated. We al","authors_text":"Alexandros Iosifidis, Dat Thanh Tran, Moncef Gabbouj","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-17T18:57:33Z","title":"Subset Sampling For Progressive Neural Network Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.07141","kind":"arxiv","version":2},"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:34ddbbc9d1468e18ce718fab362d0b960a39be73d84419283c5c9990ae9b495c","target":"record","created_at":"2026-07-05T01:05:26Z","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":"a2224045adca8280aa7295941ba7b3d8facd36ac10995f6aa0c8616121d9a490","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-17T18:57:33Z","title_canon_sha256":"950c5d183a03fcbbb042ce8ece5ece9c62601a29b9e8fbd852f2371427261b9d"},"schema_version":"1.0","source":{"id":"2002.07141","kind":"arxiv","version":2}},"canonical_sha256":"6f63a8a046c06e2d36be795afae10708a38a9a1e1fe11354f102adbd682a99a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f63a8a046c06e2d36be795afae10708a38a9a1e1fe11354f102adbd682a99a7","first_computed_at":"2026-07-05T01:05:26.251002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:05:26.251002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PN1rXwQVC5fVwjlpavKsPEm+shKpQ6VHIBJaUI2zw7dsG6EOAZYTR3eFIsFq9dlaGfhrzKdOvI7wOzhb7MxFBA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:05:26.251490Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.07141","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34ddbbc9d1468e18ce718fab362d0b960a39be73d84419283c5c9990ae9b495c","sha256:100c87f0302e5f11b30157489def11bf8cc5ab4c5b3cc7c239215f3adc2f0c8a"],"state_sha256":"39b085843b3de0ff5a067583df2d35b2a108e8f62178e80c63ca9b79c1cc9140"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPuFGc92KZyl/BBL5kskx3P6vAM9suR4HN2tBN0RMbnPu9sqGcL7eHElxkINxbeH38N21Yon/u5shXka2FZABQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:02:19.993102Z","bundle_sha256":"7e8665e7988ef0570b46dba8e29911fc0cfd9c71b4ffe1a60710300308fdd9a2"}}