{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:R32OT5RGQSWQ4LCPEFUT4ULWKI","short_pith_number":"pith:R32OT5RG","canonical_record":{"source":{"id":"1602.06183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-19T15:36:38Z","cross_cats_sorted":[],"title_canon_sha256":"d0607910040391507b5c50ba210bc10bba1a688eb7280a49e5ed7168d35027cf","abstract_canon_sha256":"fdd0ecb68e799faae60ebd678532fcd05ea07332a8876355124d38f1711d44e7"},"schema_version":"1.0"},"canonical_sha256":"8ef4e9f62684ad0e2c4f21693e517652113c2f930dba7f42af36dbb9281ed383","source":{"kind":"arxiv","id":"1602.06183","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06183","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06183v1","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06183","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"pith_short_12","alias_value":"R32OT5RGQSWQ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R32OT5RGQSWQ4LCP","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R32OT5RG","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:R32OT5RGQSWQ4LCPEFUT4ULWKI","target":"record","payload":{"canonical_record":{"source":{"id":"1602.06183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-19T15:36:38Z","cross_cats_sorted":[],"title_canon_sha256":"d0607910040391507b5c50ba210bc10bba1a688eb7280a49e5ed7168d35027cf","abstract_canon_sha256":"fdd0ecb68e799faae60ebd678532fcd05ea07332a8876355124d38f1711d44e7"},"schema_version":"1.0"},"canonical_sha256":"8ef4e9f62684ad0e2c4f21693e517652113c2f930dba7f42af36dbb9281ed383","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:18.456587Z","signature_b64":"SblXIkKMR6rTihP/bqxTM8fB4ZvuHaNnFqHRrMALwB1mJCsSni6eU1RzWMYF3bLi20/be209KLQb2V2ZUtgyDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ef4e9f62684ad0e2c4f21693e517652113c2f930dba7f42af36dbb9281ed383","last_reissued_at":"2026-05-18T01:20:18.455993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:18.455993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.06183","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-18T01:20:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"etMGp7OiKkqYdYWGTYf0QAQIAsovmhlPXdwgAdUS4mOVRaYq6icGFZh60zOEVp3T9z1dxes+XC9gjxWTqpPFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:53:59.904471Z"},"content_sha256":"ad968dffe83da1a46cae9ece1f4ac1ef5c202ce0ea6ca84db8c8e696cb971227","schema_version":"1.0","event_id":"sha256:ad968dffe83da1a46cae9ece1f4ac1ef5c202ce0ea6ca84db8c8e696cb971227"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:R32OT5RGQSWQ4LCPEFUT4ULWKI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Node-By-Node Greedy Deep Learning for Interpretable Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ke Wu, Malik Magdon-Ismail","submitted_at":"2016-02-19T15:36:38Z","abstract_excerpt":"Multilayer networks have seen a resurgence under the umbrella of deep learning. Current deep learning algorithms train the layers of the network sequentially, improving algorithmic performance as well as providing some regularization. We present a new training algorithm for deep networks which trains \\emph{each node in the network} sequentially. Our algorithm is orders of magnitude faster, creates more interpretable internal representations at the node level, while not sacrificing on the ultimate out-of-sample performance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06183","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-18T01:20:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+dXFgKDvBdTQTK6/7f07nUmtOFirP6tIZWE9KHZMJVXh2JTxwHkwvlwUaAYPdmX0FwGEyvHBdK7HD+iHui35Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:53:59.905069Z"},"content_sha256":"e0a093169a665e762f6dc735c4838c3d383b4846024dc1aafd322d58c95fa279","schema_version":"1.0","event_id":"sha256:e0a093169a665e762f6dc735c4838c3d383b4846024dc1aafd322d58c95fa279"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R32OT5RGQSWQ4LCPEFUT4ULWKI/bundle.json","state_url":"https://pith.science/pith/R32OT5RGQSWQ4LCPEFUT4ULWKI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R32OT5RGQSWQ4LCPEFUT4ULWKI/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-25T16:53:59Z","links":{"resolver":"https://pith.science/pith/R32OT5RGQSWQ4LCPEFUT4ULWKI","bundle":"https://pith.science/pith/R32OT5RGQSWQ4LCPEFUT4ULWKI/bundle.json","state":"https://pith.science/pith/R32OT5RGQSWQ4LCPEFUT4ULWKI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R32OT5RGQSWQ4LCPEFUT4ULWKI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:R32OT5RGQSWQ4LCPEFUT4ULWKI","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":"fdd0ecb68e799faae60ebd678532fcd05ea07332a8876355124d38f1711d44e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-19T15:36:38Z","title_canon_sha256":"d0607910040391507b5c50ba210bc10bba1a688eb7280a49e5ed7168d35027cf"},"schema_version":"1.0","source":{"id":"1602.06183","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06183","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06183v1","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06183","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"pith_short_12","alias_value":"R32OT5RGQSWQ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R32OT5RGQSWQ4LCP","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R32OT5RG","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:e0a093169a665e762f6dc735c4838c3d383b4846024dc1aafd322d58c95fa279","target":"graph","created_at":"2026-05-18T01:20:18Z","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":"Multilayer networks have seen a resurgence under the umbrella of deep learning. Current deep learning algorithms train the layers of the network sequentially, improving algorithmic performance as well as providing some regularization. We present a new training algorithm for deep networks which trains \\emph{each node in the network} sequentially. Our algorithm is orders of magnitude faster, creates more interpretable internal representations at the node level, while not sacrificing on the ultimate out-of-sample performance.","authors_text":"Ke Wu, Malik Magdon-Ismail","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-19T15:36:38Z","title":"Node-By-Node Greedy Deep Learning for Interpretable Features"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06183","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:ad968dffe83da1a46cae9ece1f4ac1ef5c202ce0ea6ca84db8c8e696cb971227","target":"record","created_at":"2026-05-18T01:20:18Z","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":"fdd0ecb68e799faae60ebd678532fcd05ea07332a8876355124d38f1711d44e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-19T15:36:38Z","title_canon_sha256":"d0607910040391507b5c50ba210bc10bba1a688eb7280a49e5ed7168d35027cf"},"schema_version":"1.0","source":{"id":"1602.06183","kind":"arxiv","version":1}},"canonical_sha256":"8ef4e9f62684ad0e2c4f21693e517652113c2f930dba7f42af36dbb9281ed383","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ef4e9f62684ad0e2c4f21693e517652113c2f930dba7f42af36dbb9281ed383","first_computed_at":"2026-05-18T01:20:18.455993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:18.455993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SblXIkKMR6rTihP/bqxTM8fB4ZvuHaNnFqHRrMALwB1mJCsSni6eU1RzWMYF3bLi20/be209KLQb2V2ZUtgyDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:18.456587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06183","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad968dffe83da1a46cae9ece1f4ac1ef5c202ce0ea6ca84db8c8e696cb971227","sha256:e0a093169a665e762f6dc735c4838c3d383b4846024dc1aafd322d58c95fa279"],"state_sha256":"9f981d99a7fd0889c02433ad923de15f6cdf28aa7755d4421cc17b5b445a5426"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1AMJThs1ZxEKqfm7ebmPDzpHLTT97ec/L9SuEe2UPohOvl7GmwY15xGX1doveVgLITD8Hb7l8mFBGP4F1u6+AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:53:59.908185Z","bundle_sha256":"e635442b17c2a13f0213846a19a1b24693a493a11d217840463d965c6eeff866"}}