{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DA5MSYVEDXD4P6FZQWNSNT4FUG","short_pith_number":"pith:DA5MSYVE","schema_version":"1.0","canonical_sha256":"183ac962a41dc7c7f8b9859b26cf85a196cdd691fd78a98e7928c21dcc169340","source":{"kind":"arxiv","id":"2311.10609","version":1},"attestation_state":"computed","paper":{"title":"Scaling TabPFN: Sketching and Feature Selection for Tabular Prior-Data Fitted Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.LG","authors_text":"Benjamin Feuer, Chinmay Hegde, Niv Cohen","submitted_at":"2023-11-17T16:04:27Z","abstract_excerpt":"Tabular classification has traditionally relied on supervised algorithms, which estimate the parameters of a prediction model using its training data. Recently, Prior-Data Fitted Networks (PFNs) such as TabPFN have successfully learned to classify tabular data in-context: the model parameters are designed to classify new samples based on labelled training samples given after the model training. While such models show great promise, their applicability to real-world data remains limited due to the computational scale needed. Here we study the following question: given a pre-trained PFN for tabu"},"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":"2311.10609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-17T16:04:27Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"e4f79c574c08f6005d97465a3326d51fa63292b858d7a695a08a7deb612d448e","abstract_canon_sha256":"557a5b292c07f5c938759f5fb1bf2213d445e81f58e846e894075030ec38a5f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:13:54.712456Z","signature_b64":"gaho7iIMUEYQ9h+W2I6lvt53vTH8WHrEzckhgr3RmUt1lltnORSPlbsFQPptaNFAJmgMR7FIhgE3IGGxKP4iDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"183ac962a41dc7c7f8b9859b26cf85a196cdd691fd78a98e7928c21dcc169340","last_reissued_at":"2026-07-05T07:13:54.712049Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:13:54.712049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling TabPFN: Sketching and Feature Selection for Tabular Prior-Data Fitted Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.LG","authors_text":"Benjamin Feuer, Chinmay Hegde, Niv Cohen","submitted_at":"2023-11-17T16:04:27Z","abstract_excerpt":"Tabular classification has traditionally relied on supervised algorithms, which estimate the parameters of a prediction model using its training data. Recently, Prior-Data Fitted Networks (PFNs) such as TabPFN have successfully learned to classify tabular data in-context: the model parameters are designed to classify new samples based on labelled training samples given after the model training. While such models show great promise, their applicability to real-world data remains limited due to the computational scale needed. Here we study the following question: given a pre-trained PFN for tabu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.10609","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.10609/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":"2311.10609","created_at":"2026-07-05T07:13:54.712112+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.10609v1","created_at":"2026-07-05T07:13:54.712112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.10609","created_at":"2026-07-05T07:13:54.712112+00:00"},{"alias_kind":"pith_short_12","alias_value":"DA5MSYVEDXD4","created_at":"2026-07-05T07:13:54.712112+00:00"},{"alias_kind":"pith_short_16","alias_value":"DA5MSYVEDXD4P6FZ","created_at":"2026-07-05T07:13:54.712112+00:00"},{"alias_kind":"pith_short_8","alias_value":"DA5MSYVE","created_at":"2026-07-05T07:13:54.712112+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11473","citing_title":"CRUMB: Efficient Prior Fitted Network Inference via Distributionally Matched Context Batching","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DA5MSYVEDXD4P6FZQWNSNT4FUG","json":"https://pith.science/pith/DA5MSYVEDXD4P6FZQWNSNT4FUG.json","graph_json":"https://pith.science/api/pith-number/DA5MSYVEDXD4P6FZQWNSNT4FUG/graph.json","events_json":"https://pith.science/api/pith-number/DA5MSYVEDXD4P6FZQWNSNT4FUG/events.json","paper":"https://pith.science/paper/DA5MSYVE"},"agent_actions":{"view_html":"https://pith.science/pith/DA5MSYVEDXD4P6FZQWNSNT4FUG","download_json":"https://pith.science/pith/DA5MSYVEDXD4P6FZQWNSNT4FUG.json","view_paper":"https://pith.science/paper/DA5MSYVE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.10609&json=true","fetch_graph":"https://pith.science/api/pith-number/DA5MSYVEDXD4P6FZQWNSNT4FUG/graph.json","fetch_events":"https://pith.science/api/pith-number/DA5MSYVEDXD4P6FZQWNSNT4FUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DA5MSYVEDXD4P6FZQWNSNT4FUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DA5MSYVEDXD4P6FZQWNSNT4FUG/action/storage_attestation","attest_author":"https://pith.science/pith/DA5MSYVEDXD4P6FZQWNSNT4FUG/action/author_attestation","sign_citation":"https://pith.science/pith/DA5MSYVEDXD4P6FZQWNSNT4FUG/action/citation_signature","submit_replication":"https://pith.science/pith/DA5MSYVEDXD4P6FZQWNSNT4FUG/action/replication_record"}},"created_at":"2026-07-05T07:13:54.712112+00:00","updated_at":"2026-07-05T07:13:54.712112+00:00"}