{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:E6UGD4OVCJXQ5VNUXZO2ZI4L7R","short_pith_number":"pith:E6UGD4OV","schema_version":"1.0","canonical_sha256":"27a861f1d5126f0ed5b4be5daca38bfc6e34d149ae18eb0c495a8ea3e4618087","source":{"kind":"arxiv","id":"2403.10923","version":2},"attestation_state":"computed","paper":{"title":"Interpretable Machine Learning for TabPFN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Constantin von Crailsheim, David R\\\"ugamer, David Rundel, Julius Kobialka, Matthias Feurer, Thomas Nagler","submitted_at":"2024-03-16T13:35:15Z","abstract_excerpt":"The recently developed Prior-Data Fitted Networks (PFNs) have shown very promising results for applications in low-data regimes. The TabPFN model, a special case of PFNs for tabular data, is able to achieve state-of-the-art performance on a variety of classification tasks while producing posterior predictive distributions in mere seconds by in-context learning without the need for learning parameters or hyperparameter tuning. This makes TabPFN a very attractive option for a wide range of domain applications. However, a major drawback of the method is its lack of interpretability. Therefore, we"},"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":"2403.10923","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-16T13:35:15Z","cross_cats_sorted":["cs.AI","stat.CO","stat.ML"],"title_canon_sha256":"b315f25e9d4ff7b3702d92274711ea2c44c4da2976f8dfafb10f8d592cca1129","abstract_canon_sha256":"89c9a224005e8c0bf7165e907aa31172c711c7cb7d5a41c886b1bc0c2544f864"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:47:16.693174Z","signature_b64":"gT70l3XnWgEhEAh5aiil36DmiuV+nGayKgeg50KEONnERvAYaPEEzPeioM0dcisD75Z6IiArnPlnd58I9uqlCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27a861f1d5126f0ed5b4be5daca38bfc6e34d149ae18eb0c495a8ea3e4618087","last_reissued_at":"2026-07-05T08:47:16.692687Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:47:16.692687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interpretable Machine Learning for TabPFN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Constantin von Crailsheim, David R\\\"ugamer, David Rundel, Julius Kobialka, Matthias Feurer, Thomas Nagler","submitted_at":"2024-03-16T13:35:15Z","abstract_excerpt":"The recently developed Prior-Data Fitted Networks (PFNs) have shown very promising results for applications in low-data regimes. The TabPFN model, a special case of PFNs for tabular data, is able to achieve state-of-the-art performance on a variety of classification tasks while producing posterior predictive distributions in mere seconds by in-context learning without the need for learning parameters or hyperparameter tuning. This makes TabPFN a very attractive option for a wide range of domain applications. However, a major drawback of the method is its lack of interpretability. Therefore, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.10923","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/2403.10923/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":"2403.10923","created_at":"2026-07-05T08:47:16.692754+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.10923v2","created_at":"2026-07-05T08:47:16.692754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.10923","created_at":"2026-07-05T08:47:16.692754+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6UGD4OVCJXQ","created_at":"2026-07-05T08:47:16.692754+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6UGD4OVCJXQ5VNU","created_at":"2026-07-05T08:47:16.692754+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6UGD4OV","created_at":"2026-07-05T08:47:16.692754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.05265","citing_title":"Evaluating Machine Learning Models for Post-Wildfire Debris-Flow Prediction","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E6UGD4OVCJXQ5VNUXZO2ZI4L7R","json":"https://pith.science/pith/E6UGD4OVCJXQ5VNUXZO2ZI4L7R.json","graph_json":"https://pith.science/api/pith-number/E6UGD4OVCJXQ5VNUXZO2ZI4L7R/graph.json","events_json":"https://pith.science/api/pith-number/E6UGD4OVCJXQ5VNUXZO2ZI4L7R/events.json","paper":"https://pith.science/paper/E6UGD4OV"},"agent_actions":{"view_html":"https://pith.science/pith/E6UGD4OVCJXQ5VNUXZO2ZI4L7R","download_json":"https://pith.science/pith/E6UGD4OVCJXQ5VNUXZO2ZI4L7R.json","view_paper":"https://pith.science/paper/E6UGD4OV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.10923&json=true","fetch_graph":"https://pith.science/api/pith-number/E6UGD4OVCJXQ5VNUXZO2ZI4L7R/graph.json","fetch_events":"https://pith.science/api/pith-number/E6UGD4OVCJXQ5VNUXZO2ZI4L7R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6UGD4OVCJXQ5VNUXZO2ZI4L7R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6UGD4OVCJXQ5VNUXZO2ZI4L7R/action/storage_attestation","attest_author":"https://pith.science/pith/E6UGD4OVCJXQ5VNUXZO2ZI4L7R/action/author_attestation","sign_citation":"https://pith.science/pith/E6UGD4OVCJXQ5VNUXZO2ZI4L7R/action/citation_signature","submit_replication":"https://pith.science/pith/E6UGD4OVCJXQ5VNUXZO2ZI4L7R/action/replication_record"}},"created_at":"2026-07-05T08:47:16.692754+00:00","updated_at":"2026-07-05T08:47:16.692754+00:00"}