{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:6TUB3LWWRPKNARAFZD5PVLQF3Q","short_pith_number":"pith:6TUB3LWW","schema_version":"1.0","canonical_sha256":"f4e81daed68bd4d04405c8fafaae05dc1b2069d6ff1d48420a1c1aef83fa7f27","source":{"kind":"arxiv","id":"2004.13912","version":2},"attestation_state":"computed","paper":{"title":"Neural Additive Models: Interpretable Machine Learning with Neural Nets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ben Lengerich, Geoffrey Hinton, Levi Melnick, Nicholas Frosst, Rich Caruana, Rishabh Agarwal, Xuezhou Zhang","submitted_at":"2020-04-29T01:28:32Z","abstract_excerpt":"Deep neural networks (DNNs) are powerful black-box predictors that have achieved impressive performance on a wide variety of tasks. However, their accuracy comes at the cost of intelligibility: it is usually unclear how they make their decisions. This hinders their applicability to high stakes decision-making domains such as healthcare. We propose Neural Additive Models (NAMs) which combine some of the expressivity of DNNs with the inherent intelligibility of generalized additive models. NAMs learn a linear combination of neural networks that each attend to a single input feature. These networ"},"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":"2004.13912","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-04-29T01:28:32Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"016d8216c523faa76bf902e55ef77efefaa37c9bb7f4385c05d6c74e99c3bd99","abstract_canon_sha256":"99af487c2ca9a2045ccb97249f5828fda259dd3b82283f3e7c767a8eabaab145"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:25:09.989143Z","signature_b64":"S9LbYulAPawcWNjo3JaTWqYBzaZ7qUIKeexEWfryz5U/SngmTZMFQHjXgDpBy/2E4qapkwkL7EPl2ZXUG8S6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4e81daed68bd4d04405c8fafaae05dc1b2069d6ff1d48420a1c1aef83fa7f27","last_reissued_at":"2026-07-05T03:25:09.988751Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:25:09.988751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Additive Models: Interpretable Machine Learning with Neural Nets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ben Lengerich, Geoffrey Hinton, Levi Melnick, Nicholas Frosst, Rich Caruana, Rishabh Agarwal, Xuezhou Zhang","submitted_at":"2020-04-29T01:28:32Z","abstract_excerpt":"Deep neural networks (DNNs) are powerful black-box predictors that have achieved impressive performance on a wide variety of tasks. However, their accuracy comes at the cost of intelligibility: it is usually unclear how they make their decisions. This hinders their applicability to high stakes decision-making domains such as healthcare. We propose Neural Additive Models (NAMs) which combine some of the expressivity of DNNs with the inherent intelligibility of generalized additive models. NAMs learn a linear combination of neural networks that each attend to a single input feature. These networ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.13912","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/2004.13912/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2004.13912","created_at":"2026-07-05T03:25:09.988808+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.13912v2","created_at":"2026-07-05T03:25:09.988808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.13912","created_at":"2026-07-05T03:25:09.988808+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TUB3LWWRPKN","created_at":"2026-07-05T03:25:09.988808+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TUB3LWWRPKNARAF","created_at":"2026-07-05T03:25:09.988808+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TUB3LWW","created_at":"2026-07-05T03:25:09.988808+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23575","citing_title":"Solve for the Hyperparameter, Skip the Search: Kolmogorov-Optimal Scaling Laws for Spline Regression","ref_index":73,"is_internal_anchor":false},{"citing_arxiv_id":"2502.05564","citing_title":"TabICL: A Tabular Foundation Model for In-Context Learning on Large Data","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2502.05564","citing_title":"TabICL: A Tabular Foundation Model for In-Context Learning on Large Data","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6TUB3LWWRPKNARAFZD5PVLQF3Q","json":"https://pith.science/pith/6TUB3LWWRPKNARAFZD5PVLQF3Q.json","graph_json":"https://pith.science/api/pith-number/6TUB3LWWRPKNARAFZD5PVLQF3Q/graph.json","events_json":"https://pith.science/api/pith-number/6TUB3LWWRPKNARAFZD5PVLQF3Q/events.json","paper":"https://pith.science/paper/6TUB3LWW"},"agent_actions":{"view_html":"https://pith.science/pith/6TUB3LWWRPKNARAFZD5PVLQF3Q","download_json":"https://pith.science/pith/6TUB3LWWRPKNARAFZD5PVLQF3Q.json","view_paper":"https://pith.science/paper/6TUB3LWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.13912&json=true","fetch_graph":"https://pith.science/api/pith-number/6TUB3LWWRPKNARAFZD5PVLQF3Q/graph.json","fetch_events":"https://pith.science/api/pith-number/6TUB3LWWRPKNARAFZD5PVLQF3Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TUB3LWWRPKNARAFZD5PVLQF3Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TUB3LWWRPKNARAFZD5PVLQF3Q/action/storage_attestation","attest_author":"https://pith.science/pith/6TUB3LWWRPKNARAFZD5PVLQF3Q/action/author_attestation","sign_citation":"https://pith.science/pith/6TUB3LWWRPKNARAFZD5PVLQF3Q/action/citation_signature","submit_replication":"https://pith.science/pith/6TUB3LWWRPKNARAFZD5PVLQF3Q/action/replication_record"}},"created_at":"2026-07-05T03:25:09.988808+00:00","updated_at":"2026-07-05T03:25:09.988808+00:00"}