{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YQECANQJPDNQQY55IBGXIVWEYD","short_pith_number":"pith:YQECANQJ","canonical_record":{"source":{"id":"2601.21656","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-29T12:56:41Z","cross_cats_sorted":[],"title_canon_sha256":"1034c67585577229f33c36ca2e3318c2d6b6db96de232b13a1fd0d1331b5ed06","abstract_canon_sha256":"52237989bfe2f9d02b9c67c7377f89fba6d3ce6b1b437e61a8cef3cc7d241419"},"schema_version":"1.0"},"canonical_sha256":"c40820360978db0863bd404d7456c4c0e7ea3a9b1f784bde4f589a642ac46093","source":{"kind":"arxiv","id":"2601.21656","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.21656","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"2601.21656v3","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.21656","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"YQECANQJPDNQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"YQECANQJPDNQQY55","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"YQECANQJ","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YQECANQJPDNQQY55IBGXIVWEYD","target":"record","payload":{"canonical_record":{"source":{"id":"2601.21656","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-29T12:56:41Z","cross_cats_sorted":[],"title_canon_sha256":"1034c67585577229f33c36ca2e3318c2d6b6db96de232b13a1fd0d1331b5ed06","abstract_canon_sha256":"52237989bfe2f9d02b9c67c7377f89fba6d3ce6b1b437e61a8cef3cc7d241419"},"schema_version":"1.0"},"canonical_sha256":"c40820360978db0863bd404d7456c4c0e7ea3a9b1f784bde4f589a642ac46093","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:16.532828Z","signature_b64":"mGLE5Gui49hzVOgwiWqPLm7Xu1YK1/xAERtdiSYUxtwI36tB6TVeJA/SznyE7+9049YD9cwcuhMFyRCx7k7sCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c40820360978db0863bd404d7456c4c0e7ea3a9b1f784bde4f589a642ac46093","last_reissued_at":"2026-05-17T23:39:16.532043Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:16.532043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.21656","source_version":3,"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-17T23:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4mxaTOWEBGRj6ADBPvJ86Po1HUz9sfZgB5CxhK3t6DtH7ZAgUQmcFdZFD684HyqmdKZHxzvBst/4DNOtQ/xTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:25:01.801189Z"},"content_sha256":"cb7e72d7a1885f7d9c1802f8e9959fea801a1e7fe2b4215e58ddbfcfb85202ef","schema_version":"1.0","event_id":"sha256:cb7e72d7a1885f7d9c1802f8e9959fea801a1e7fe2b4215e58ddbfcfb85202ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YQECANQJPDNQQY55IBGXIVWEYD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TabClustPFN: A Prior-Fitted Network for Tabular Data Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"TabClustPFN clusters any new tabular dataset in one forward pass by amortizing Bayesian inference over assignments and cluster count.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Guanyang Wang, Qiong Zhang, Tianqi Zhao, Yan Shuo Tan","submitted_at":"2026-01-29T12:56:41Z","abstract_excerpt":"Clustering tabular data is a fundamental yet challenging problem due to heterogeneous feature types, diverse data-generating mechanisms, and the absence of transferable inductive biases across datasets. Prior-fitted networks (PFNs) have recently demonstrated strong generalization in supervised tabular learning by amortizing Bayesian inference under a broad synthetic prior. Extending this paradigm to clustering is nontrivial: clustering is unsupervised, admits a combinatorial and permutation-invariant output space, and requires inferring the number of clusters. We introduce TabClustPFN, a prior"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"TabClustPFN clusters unseen datasets in a single forward pass, without dataset-specific retraining or hyperparameter tuning, and outperforms classical, deep, and amortized clustering baselines on synthetic and real-world tabular benchmarks.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The synthetic datasets drawn from the flexible clustering prior sufficiently resemble the structure and heterogeneity of real-world tabular data so that the pretrained network generalizes without retraining.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"TabClustPFN performs amortized Bayesian inference for cluster assignments and cardinality on unseen tabular data after pretraining on synthetic data from a flexible prior.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"TabClustPFN clusters any new tabular dataset in one forward pass by amortizing Bayesian inference over assignments and cluster count.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3610ef08aff7512d9ad37ada2a4ca7d20ce55658998676b9a0ca8e3a29fe09c2"},"source":{"id":"2601.21656","kind":"arxiv","version":3},"verdict":{"id":"60e87dcc-2129-489e-9d70-363a3a0daeab","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T10:28:09.541684Z","strongest_claim":"TabClustPFN clusters unseen datasets in a single forward pass, without dataset-specific retraining or hyperparameter tuning, and outperforms classical, deep, and amortized clustering baselines on synthetic and real-world tabular benchmarks.","one_line_summary":"TabClustPFN performs amortized Bayesian inference for cluster assignments and cardinality on unseen tabular data after pretraining on synthetic data from a flexible prior.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The synthetic datasets drawn from the flexible clustering prior sufficiently resemble the structure and heterogeneity of real-world tabular data so that the pretrained network generalizes without retraining.","pith_extraction_headline":"TabClustPFN clusters any new tabular dataset in one forward pass by amortizing Bayesian inference over assignments and cluster count."},"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":"60e87dcc-2129-489e-9d70-363a3a0daeab"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vBFBCb1ZYHjbebjb6Wz97g7YG3rQPX5z7IAEx+vkMOe/tiUzizbzd+m0k8DHLxejpSyOIIkChu2AcRFH6KneAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:25:01.801656Z"},"content_sha256":"6d59c20178f7e35a84cff9a7602e8f28f96829357277c0f7f778f5fc080543d0","schema_version":"1.0","event_id":"sha256:6d59c20178f7e35a84cff9a7602e8f28f96829357277c0f7f778f5fc080543d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQECANQJPDNQQY55IBGXIVWEYD/bundle.json","state_url":"https://pith.science/pith/YQECANQJPDNQQY55IBGXIVWEYD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQECANQJPDNQQY55IBGXIVWEYD/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-31T19:25:01Z","links":{"resolver":"https://pith.science/pith/YQECANQJPDNQQY55IBGXIVWEYD","bundle":"https://pith.science/pith/YQECANQJPDNQQY55IBGXIVWEYD/bundle.json","state":"https://pith.science/pith/YQECANQJPDNQQY55IBGXIVWEYD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQECANQJPDNQQY55IBGXIVWEYD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YQECANQJPDNQQY55IBGXIVWEYD","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":"52237989bfe2f9d02b9c67c7377f89fba6d3ce6b1b437e61a8cef3cc7d241419","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-29T12:56:41Z","title_canon_sha256":"1034c67585577229f33c36ca2e3318c2d6b6db96de232b13a1fd0d1331b5ed06"},"schema_version":"1.0","source":{"id":"2601.21656","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.21656","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"2601.21656v3","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.21656","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"YQECANQJPDNQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"YQECANQJPDNQQY55","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"YQECANQJ","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:6d59c20178f7e35a84cff9a7602e8f28f96829357277c0f7f778f5fc080543d0","target":"graph","created_at":"2026-05-17T23:39:16Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"TabClustPFN clusters unseen datasets in a single forward pass, without dataset-specific retraining or hyperparameter tuning, and outperforms classical, deep, and amortized clustering baselines on synthetic and real-world tabular benchmarks."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The synthetic datasets drawn from the flexible clustering prior sufficiently resemble the structure and heterogeneity of real-world tabular data so that the pretrained network generalizes without retraining."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"TabClustPFN performs amortized Bayesian inference for cluster assignments and cardinality on unseen tabular data after pretraining on synthetic data from a flexible prior."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"TabClustPFN clusters any new tabular dataset in one forward pass by amortizing Bayesian inference over assignments and cluster count."}],"snapshot_sha256":"3610ef08aff7512d9ad37ada2a4ca7d20ce55658998676b9a0ca8e3a29fe09c2"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Clustering tabular data is a fundamental yet challenging problem due to heterogeneous feature types, diverse data-generating mechanisms, and the absence of transferable inductive biases across datasets. Prior-fitted networks (PFNs) have recently demonstrated strong generalization in supervised tabular learning by amortizing Bayesian inference under a broad synthetic prior. Extending this paradigm to clustering is nontrivial: clustering is unsupervised, admits a combinatorial and permutation-invariant output space, and requires inferring the number of clusters. We introduce TabClustPFN, a prior","authors_text":"Guanyang Wang, Qiong Zhang, Tianqi Zhao, Yan Shuo Tan","cross_cats":[],"headline":"TabClustPFN clusters any new tabular dataset in one forward pass by amortizing Bayesian inference over assignments and cluster count.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-29T12:56:41Z","title":"TabClustPFN: A Prior-Fitted Network for Tabular Data Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.21656","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-16T10:28:09.541684Z","id":"60e87dcc-2129-489e-9d70-363a3a0daeab","model_set":{"reader":"grok-4.3"},"one_line_summary":"TabClustPFN performs amortized Bayesian inference for cluster assignments and cardinality on unseen tabular data after pretraining on synthetic data from a flexible prior.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"TabClustPFN clusters any new tabular dataset in one forward pass by amortizing Bayesian inference over assignments and cluster count.","strongest_claim":"TabClustPFN clusters unseen datasets in a single forward pass, without dataset-specific retraining or hyperparameter tuning, and outperforms classical, deep, and amortized clustering baselines on synthetic and real-world tabular benchmarks.","weakest_assumption":"The synthetic datasets drawn from the flexible clustering prior sufficiently resemble the structure and heterogeneity of real-world tabular data so that the pretrained network generalizes without retraining."}},"verdict_id":"60e87dcc-2129-489e-9d70-363a3a0daeab"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cb7e72d7a1885f7d9c1802f8e9959fea801a1e7fe2b4215e58ddbfcfb85202ef","target":"record","created_at":"2026-05-17T23:39:16Z","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":"52237989bfe2f9d02b9c67c7377f89fba6d3ce6b1b437e61a8cef3cc7d241419","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-29T12:56:41Z","title_canon_sha256":"1034c67585577229f33c36ca2e3318c2d6b6db96de232b13a1fd0d1331b5ed06"},"schema_version":"1.0","source":{"id":"2601.21656","kind":"arxiv","version":3}},"canonical_sha256":"c40820360978db0863bd404d7456c4c0e7ea3a9b1f784bde4f589a642ac46093","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c40820360978db0863bd404d7456c4c0e7ea3a9b1f784bde4f589a642ac46093","first_computed_at":"2026-05-17T23:39:16.532043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:16.532043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mGLE5Gui49hzVOgwiWqPLm7Xu1YK1/xAERtdiSYUxtwI36tB6TVeJA/SznyE7+9049YD9cwcuhMFyRCx7k7sCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:16.532828Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.21656","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb7e72d7a1885f7d9c1802f8e9959fea801a1e7fe2b4215e58ddbfcfb85202ef","sha256:6d59c20178f7e35a84cff9a7602e8f28f96829357277c0f7f778f5fc080543d0"],"state_sha256":"6076aa7218386fa4d1b0b82302f1f2f4fb1b59d2d3c250f58ccefd0908605565"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Df/woNcEHVJ/mcTKL/TvlUEzEXHq4pH0zugnWbbOTSkmvq8oF1hUcM+6zmHSWn62i91iNsQMWQFbA8QAaVENDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:25:01.804653Z","bundle_sha256":"fb385784fefd04644ba3b2dd0b467ff57987b12e91920f2c7dd009cafda01cc3"}}