{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:R32OT5RGQSWQ4LCPEFUT4ULWKI","short_pith_number":"pith:R32OT5RG","schema_version":"1.0","canonical_sha256":"8ef4e9f62684ad0e2c4f21693e517652113c2f930dba7f42af36dbb9281ed383","source":{"kind":"arxiv","id":"1602.06183","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.06183","created_at":"2026-05-18T01:20:18.456104+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.06183v1","created_at":"2026-05-18T01:20:18.456104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06183","created_at":"2026-05-18T01:20:18.456104+00:00"},{"alias_kind":"pith_short_12","alias_value":"R32OT5RGQSWQ","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"R32OT5RGQSWQ4LCP","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"R32OT5RG","created_at":"2026-05-18T12:30:41.710351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R32OT5RGQSWQ4LCPEFUT4ULWKI","json":"https://pith.science/pith/R32OT5RGQSWQ4LCPEFUT4ULWKI.json","graph_json":"https://pith.science/api/pith-number/R32OT5RGQSWQ4LCPEFUT4ULWKI/graph.json","events_json":"https://pith.science/api/pith-number/R32OT5RGQSWQ4LCPEFUT4ULWKI/events.json","paper":"https://pith.science/paper/R32OT5RG"},"agent_actions":{"view_html":"https://pith.science/pith/R32OT5RGQSWQ4LCPEFUT4ULWKI","download_json":"https://pith.science/pith/R32OT5RGQSWQ4LCPEFUT4ULWKI.json","view_paper":"https://pith.science/paper/R32OT5RG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.06183&json=true","fetch_graph":"https://pith.science/api/pith-number/R32OT5RGQSWQ4LCPEFUT4ULWKI/graph.json","fetch_events":"https://pith.science/api/pith-number/R32OT5RGQSWQ4LCPEFUT4ULWKI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R32OT5RGQSWQ4LCPEFUT4ULWKI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R32OT5RGQSWQ4LCPEFUT4ULWKI/action/storage_attestation","attest_author":"https://pith.science/pith/R32OT5RGQSWQ4LCPEFUT4ULWKI/action/author_attestation","sign_citation":"https://pith.science/pith/R32OT5RGQSWQ4LCPEFUT4ULWKI/action/citation_signature","submit_replication":"https://pith.science/pith/R32OT5RGQSWQ4LCPEFUT4ULWKI/action/replication_record"}},"created_at":"2026-05-18T01:20:18.456104+00:00","updated_at":"2026-05-18T01:20:18.456104+00:00"}