{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:543MDZFSJ2342HFU27QMI7ZWUQ","short_pith_number":"pith:543MDZFS","canonical_record":{"source":{"id":"1906.01026","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-03T19:03:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b5d9c6ac02fca895e1244c31cf1e8a0b7f150e3b37819507e08a7349639a3062","abstract_canon_sha256":"5b0ffdf65e5bbce4860e18d57ab043ae10dea11d15e78bec7eeaae6c94551acd"},"schema_version":"1.0"},"canonical_sha256":"ef36c1e4b24eb7cd1cb4d7e0c47f36a40e476a814fcfafbea9f3e0202e30a85a","source":{"kind":"arxiv","id":"1906.01026","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01026","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01026v2","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01026","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"pith_short_12","alias_value":"543MDZFSJ234","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"543MDZFSJ2342HFU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"543MDZFS","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:543MDZFSJ2342HFU27QMI7ZWUQ","target":"record","payload":{"canonical_record":{"source":{"id":"1906.01026","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-03T19:03:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b5d9c6ac02fca895e1244c31cf1e8a0b7f150e3b37819507e08a7349639a3062","abstract_canon_sha256":"5b0ffdf65e5bbce4860e18d57ab043ae10dea11d15e78bec7eeaae6c94551acd"},"schema_version":"1.0"},"canonical_sha256":"ef36c1e4b24eb7cd1cb4d7e0c47f36a40e476a814fcfafbea9f3e0202e30a85a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:32.535130Z","signature_b64":"giZESJ4xCj6wuLd3ILdrl44MvYYo+0NALxKn53WnCT1KZsfbSRZdYII8hJSICzb5Hn7SKkXNDt/Ct3+k+Q7GCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef36c1e4b24eb7cd1cb4d7e0c47f36a40e476a814fcfafbea9f3e0202e30a85a","last_reissued_at":"2026-05-17T23:43:32.534721Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:32.534721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.01026","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-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":"8SglMQHv6395eFoshFneYsGVu1TiZ1cRBq31Rba3Lv8lVD6IxlqJuK6zws/rRMxoaTRXHhWtrSy/AFgux3CkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:50:26.610771Z"},"content_sha256":"02f83f12a3dd4fed7a9b103b07c3249f9e93be5ebb1c9400b3f6dcc9f2ad01bc","schema_version":"1.0","event_id":"sha256:02f83f12a3dd4fed7a9b103b07c3249f9e93be5ebb1c9400b3f6dcc9f2ad01bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:543MDZFSJ2342HFU27QMI7ZWUQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"NodeDrop: A Condition for Reducing Network Size without Effect on Output","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jacob Harer, Louis Jensen, Sang Chin","submitted_at":"2019-06-03T19:03:46Z","abstract_excerpt":"Determining an appropriate number of features for each layer in a neural network is an important and difficult task. This task is especially important in applications on systems with limited memory or processing power. Many current approaches to reduce network size either utilize iterative procedures, which can extend training time significantly, or require very careful tuning of algorithm parameters to achieve reasonable results. In this paper we propose NodeDrop, a new method for eliminating features in a network. With NodeDrop, we define a condition to identify and guarantee which nodes car"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01026","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":""},"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":"WRZ9++pydICcV3C8UOnvlmW43RXmBn9L66Oufl/3kGBry+HjFYgXHldiPL5GoYp7U7KB7CUj/YpVzo1HMbfOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:50:26.611128Z"},"content_sha256":"6a0f5eb14c37ba6ce2976cd3e3d8e9082e298dedbcb07849ef2a1f878edc6723","schema_version":"1.0","event_id":"sha256:6a0f5eb14c37ba6ce2976cd3e3d8e9082e298dedbcb07849ef2a1f878edc6723"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/543MDZFSJ2342HFU27QMI7ZWUQ/bundle.json","state_url":"https://pith.science/pith/543MDZFSJ2342HFU27QMI7ZWUQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/543MDZFSJ2342HFU27QMI7ZWUQ/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-03T14:50:26Z","links":{"resolver":"https://pith.science/pith/543MDZFSJ2342HFU27QMI7ZWUQ","bundle":"https://pith.science/pith/543MDZFSJ2342HFU27QMI7ZWUQ/bundle.json","state":"https://pith.science/pith/543MDZFSJ2342HFU27QMI7ZWUQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/543MDZFSJ2342HFU27QMI7ZWUQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:543MDZFSJ2342HFU27QMI7ZWUQ","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":"5b0ffdf65e5bbce4860e18d57ab043ae10dea11d15e78bec7eeaae6c94551acd","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-03T19:03:46Z","title_canon_sha256":"b5d9c6ac02fca895e1244c31cf1e8a0b7f150e3b37819507e08a7349639a3062"},"schema_version":"1.0","source":{"id":"1906.01026","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01026","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01026v2","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01026","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"pith_short_12","alias_value":"543MDZFSJ234","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"543MDZFSJ2342HFU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"543MDZFS","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:6a0f5eb14c37ba6ce2976cd3e3d8e9082e298dedbcb07849ef2a1f878edc6723","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":"Determining an appropriate number of features for each layer in a neural network is an important and difficult task. This task is especially important in applications on systems with limited memory or processing power. Many current approaches to reduce network size either utilize iterative procedures, which can extend training time significantly, or require very careful tuning of algorithm parameters to achieve reasonable results. In this paper we propose NodeDrop, a new method for eliminating features in a network. With NodeDrop, we define a condition to identify and guarantee which nodes car","authors_text":"Jacob Harer, Louis Jensen, Sang Chin","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-03T19:03:46Z","title":"NodeDrop: A Condition for Reducing Network Size without Effect on Output"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01026","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:02f83f12a3dd4fed7a9b103b07c3249f9e93be5ebb1c9400b3f6dcc9f2ad01bc","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":"5b0ffdf65e5bbce4860e18d57ab043ae10dea11d15e78bec7eeaae6c94551acd","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-03T19:03:46Z","title_canon_sha256":"b5d9c6ac02fca895e1244c31cf1e8a0b7f150e3b37819507e08a7349639a3062"},"schema_version":"1.0","source":{"id":"1906.01026","kind":"arxiv","version":2}},"canonical_sha256":"ef36c1e4b24eb7cd1cb4d7e0c47f36a40e476a814fcfafbea9f3e0202e30a85a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef36c1e4b24eb7cd1cb4d7e0c47f36a40e476a814fcfafbea9f3e0202e30a85a","first_computed_at":"2026-05-17T23:43:32.534721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:32.534721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"giZESJ4xCj6wuLd3ILdrl44MvYYo+0NALxKn53WnCT1KZsfbSRZdYII8hJSICzb5Hn7SKkXNDt/Ct3+k+Q7GCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:32.535130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.01026","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02f83f12a3dd4fed7a9b103b07c3249f9e93be5ebb1c9400b3f6dcc9f2ad01bc","sha256:6a0f5eb14c37ba6ce2976cd3e3d8e9082e298dedbcb07849ef2a1f878edc6723"],"state_sha256":"4e603b6ff23bab4ceabfc58c2a62c3bac90d9dc846c3aea2de52509bfdd53242"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J05KU9xk8VjvRN/DN1ZP7oNUHSSINEebPPJMJsU5Ea9f/vP9+zmJbUFU48h4QmpYflc/tAkiOoqnCO44vj64AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:50:26.613075Z","bundle_sha256":"f961e0308ef46e43024a98d545bd1e8d8d8349fc9e2df3c1a755969177310a01"}}