{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:P2AECYT4XDXVW6XLRIORKIDQPS","short_pith_number":"pith:P2AECYT4","canonical_record":{"source":{"id":"2511.08667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-11T18:57:15Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3237b357c6bb4bfa8fd6e8fa85eaf5e2d5d077dacfe3e658bce83dcd9adcc2b2","abstract_canon_sha256":"34d2eb8cbaa7899adab58fe896c619c419da6ad5a95e700f54d3bf64098685d6"},"schema_version":"1.0"},"canonical_sha256":"7e8041627cb8ef5b7aeb8a1d1520707ca72c006a8dd784ad25a232dea2aa2ea1","source":{"kind":"arxiv","id":"2511.08667","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.08667","created_at":"2026-05-17T23:38:53Z"},{"alias_kind":"arxiv_version","alias_value":"2511.08667v2","created_at":"2026-05-17T23:38:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.08667","created_at":"2026-05-17T23:38:53Z"},{"alias_kind":"pith_short_12","alias_value":"P2AECYT4XDXV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"P2AECYT4XDXVW6XL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"P2AECYT4","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:P2AECYT4XDXVW6XLRIORKIDQPS","target":"record","payload":{"canonical_record":{"source":{"id":"2511.08667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-11T18:57:15Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3237b357c6bb4bfa8fd6e8fa85eaf5e2d5d077dacfe3e658bce83dcd9adcc2b2","abstract_canon_sha256":"34d2eb8cbaa7899adab58fe896c619c419da6ad5a95e700f54d3bf64098685d6"},"schema_version":"1.0"},"canonical_sha256":"7e8041627cb8ef5b7aeb8a1d1520707ca72c006a8dd784ad25a232dea2aa2ea1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:53.574576Z","signature_b64":"9ttoUZyduho0rezoAiUSMZFGAhKtLhCpg3OknvZyQ8o8vSTsP4SgcUlpq9VZ4jYyTQ5i2WHde0kfQh580QXLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e8041627cb8ef5b7aeb8a1d1520707ca72c006a8dd784ad25a232dea2aa2ea1","last_reissued_at":"2026-05-17T23:38:53.573895Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:53.573895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2511.08667","source_version":2,"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:38:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MF8hDczzthSqm//OOH/UV7kPL+10J2gAhljpHGEg2tSETlrc5kkRHoTaZ1xY5HBM/p0OvP58aK00oDn6TfZDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:12:35.867494Z"},"content_sha256":"dd53e66f8b3626d2e1d16852fb984fea3295394e1b9080b9614b5a10eccba4e7","schema_version":"1.0","event_id":"sha256:dd53e66f8b3626d2e1d16852fb984fea3295394e1b9080b9614b5a10eccba4e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:P2AECYT4XDXVW6XLRIORKIDQPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TabPFN-2.5: Advancing the State of the Art in Tabular Foundation Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"TabPFN-2.5 scales tabular foundation models to 20 times more data cells and leads the TabArena benchmark.","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Adrian Hayler, Alessandro Bonetto, Anurag Garg, Benjamin J\\\"ager, Bernhard Sch\\\"olkopf, Brendan Roof, Clara Cornu, Dominik Safaric, Felix Birkel, Felix Jablonski, Frank Hutter, Jake Robertson, Klemens Fl\\\"oge, Lennart Purucker, L\\'eo Grinsztajn, Lilly Charlotte Wehrhahn, Magnus B\\\"uhler, Mihir Manium, Noah Hollmann, Oscar Key, Philipp Jund, Rosen Yu, Sauraj Gambhir, Shi Bin Hoo, Simone Alessi, Vladyslav Moroshan","submitted_at":"2025-11-11T18:57:15Z","abstract_excerpt":"The first tabular foundation model, TabPFN, and its successor TabPFNv2 have impacted tabular AI substantially, with dozens of methods building on it and hundreds of applications across different use cases. This report introduces TabPFN-2.5, the next generation of our tabular foundation model, built for datasets with up to 50,000 data points and 2,000 features, a 20x increase in data cells compared to TabPFNv2. TabPFN-2.5 is now the leading method for the industry standard benchmark TabArena (which contains datasets with up to 100,000 training data points), substantially outperforming tuned tre"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"default TabPFN-2.5 has a 100% win rate against default XGBoost on small to medium-sized classification datasets (<=10,000 data points, 500 features) and a 87% win rate on larger datasets up to 100K samples and 2K features (85% for regression).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the reported win rates and benchmark leadership on TabArena will generalize to new, unseen datasets outside the benchmark collection and that the training procedure does not contain undisclosed hyperparameter advantages.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"TabPFN-2.5 scales tabular foundation models to 20x larger datasets, outperforms tuned tree models on TabArena, achieves near-perfect win rates against default XGBoost, and adds a distillation engine for fast production deployment.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"TabPFN-2.5 scales tabular foundation models to 20 times more data cells and leads the TabArena benchmark.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ec6933defc008bcf261cb9ec0b317bcf84a26e01da57bdb5f2b11f4fe3adccc4"},"source":{"id":"2511.08667","kind":"arxiv","version":2},"verdict":{"id":"e0c287a1-6ff9-4980-885b-57e1da827f05","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T04:09:59.122135Z","strongest_claim":"default TabPFN-2.5 has a 100% win rate against default XGBoost on small to medium-sized classification datasets (<=10,000 data points, 500 features) and a 87% win rate on larger datasets up to 100K samples and 2K features (85% for regression).","one_line_summary":"TabPFN-2.5 scales tabular foundation models to 20x larger datasets, outperforms tuned tree models on TabArena, achieves near-perfect win rates against default XGBoost, and adds a distillation engine for fast production deployment.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the reported win rates and benchmark leadership on TabArena will generalize to new, unseen datasets outside the benchmark collection and that the training procedure does not contain undisclosed hyperparameter advantages.","pith_extraction_headline":"TabPFN-2.5 scales tabular foundation models to 20 times more data cells and leads the TabArena benchmark."},"references":{"count":250,"sample":[{"doi":"","year":2025,"title":"arXiv:2506.16791 [cs]","work_id":"155b5349-dee8-4870-965c-d54a700a19de","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"Xgboost: A scalable tree boosting system","work_id":"c12cf8a8-1951-412c-a3cd-92de4cb10ca7","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"Catboost: unbiased boosting with categorical features.Advances in neural information processing systems, 31, 2018","work_id":"cb38f37f-2ff1-4119-9239-170112c586b9","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Lightgbm: A highly efficient gradient boosting decision tree","work_id":"93734681-1fa2-4bd5-84b5-5c9c3dffda41","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1023/a","year":2001,"title":"Applying constraint satisfaction techniques to job shop scheduling , journal =","work_id":"82ab34d6-b79f-49d1-8128-5da36fe56174","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":250,"snapshot_sha256":"810ea16527aa8bc85ad81fb86abc7b1481632f43b39d8fab8c5d0722e7a3ba93","internal_anchors":7},"formal_canon":{"evidence_count":1,"snapshot_sha256":"f52de8ae04521327a8a285c2c57a8c36092076657aad26ec6eb0cafc38ff0877"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"e0c287a1-6ff9-4980-885b-57e1da827f05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:38:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FnEQ887csY/mRLILLVjpAd0LXo7wE/GdSd+P98U6k0QnSl3OXcHQ0XBudRDxcv9a5hr1qUc4ZOTixIYijNSlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:12:35.868552Z"},"content_sha256":"bb9e2bf22bc3fb04888c6bfe8a480268d8e49bfc6acd20d3506105d13f60b2dc","schema_version":"1.0","event_id":"sha256:bb9e2bf22bc3fb04888c6bfe8a480268d8e49bfc6acd20d3506105d13f60b2dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P2AECYT4XDXVW6XLRIORKIDQPS/bundle.json","state_url":"https://pith.science/pith/P2AECYT4XDXVW6XLRIORKIDQPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P2AECYT4XDXVW6XLRIORKIDQPS/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-28T21:12:35Z","links":{"resolver":"https://pith.science/pith/P2AECYT4XDXVW6XLRIORKIDQPS","bundle":"https://pith.science/pith/P2AECYT4XDXVW6XLRIORKIDQPS/bundle.json","state":"https://pith.science/pith/P2AECYT4XDXVW6XLRIORKIDQPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P2AECYT4XDXVW6XLRIORKIDQPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:P2AECYT4XDXVW6XLRIORKIDQPS","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":"34d2eb8cbaa7899adab58fe896c619c419da6ad5a95e700f54d3bf64098685d6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-11T18:57:15Z","title_canon_sha256":"3237b357c6bb4bfa8fd6e8fa85eaf5e2d5d077dacfe3e658bce83dcd9adcc2b2"},"schema_version":"1.0","source":{"id":"2511.08667","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.08667","created_at":"2026-05-17T23:38:53Z"},{"alias_kind":"arxiv_version","alias_value":"2511.08667v2","created_at":"2026-05-17T23:38:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.08667","created_at":"2026-05-17T23:38:53Z"},{"alias_kind":"pith_short_12","alias_value":"P2AECYT4XDXV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"P2AECYT4XDXVW6XL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"P2AECYT4","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:bb9e2bf22bc3fb04888c6bfe8a480268d8e49bfc6acd20d3506105d13f60b2dc","target":"graph","created_at":"2026-05-17T23:38:53Z","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":"default TabPFN-2.5 has a 100% win rate against default XGBoost on small to medium-sized classification datasets (<=10,000 data points, 500 features) and a 87% win rate on larger datasets up to 100K samples and 2K features (85% for regression)."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the reported win rates and benchmark leadership on TabArena will generalize to new, unseen datasets outside the benchmark collection and that the training procedure does not contain undisclosed hyperparameter advantages."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"TabPFN-2.5 scales tabular foundation models to 20x larger datasets, outperforms tuned tree models on TabArena, achieves near-perfect win rates against default XGBoost, and adds a distillation engine for fast production deployment."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"TabPFN-2.5 scales tabular foundation models to 20 times more data cells and leads the TabArena benchmark."}],"snapshot_sha256":"ec6933defc008bcf261cb9ec0b317bcf84a26e01da57bdb5f2b11f4fe3adccc4"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"f52de8ae04521327a8a285c2c57a8c36092076657aad26ec6eb0cafc38ff0877"},"paper":{"abstract_excerpt":"The first tabular foundation model, TabPFN, and its successor TabPFNv2 have impacted tabular AI substantially, with dozens of methods building on it and hundreds of applications across different use cases. This report introduces TabPFN-2.5, the next generation of our tabular foundation model, built for datasets with up to 50,000 data points and 2,000 features, a 20x increase in data cells compared to TabPFNv2. TabPFN-2.5 is now the leading method for the industry standard benchmark TabArena (which contains datasets with up to 100,000 training data points), substantially outperforming tuned tre","authors_text":"Adrian Hayler, Alessandro Bonetto, Anurag Garg, Benjamin J\\\"ager, Bernhard Sch\\\"olkopf, Brendan Roof, Clara Cornu, Dominik Safaric, Felix Birkel, Felix Jablonski, Frank Hutter, Jake Robertson, Klemens Fl\\\"oge, Lennart Purucker, L\\'eo Grinsztajn, Lilly Charlotte Wehrhahn, Magnus B\\\"uhler, Mihir Manium, Noah Hollmann, Oscar Key, Philipp Jund, Rosen Yu, Sauraj Gambhir, Shi Bin Hoo, Simone Alessi, Vladyslav Moroshan","cross_cats":["stat.ML"],"headline":"TabPFN-2.5 scales tabular foundation models to 20 times more data cells and leads the TabArena benchmark.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-11T18:57:15Z","title":"TabPFN-2.5: Advancing the State of the Art in Tabular Foundation Models"},"references":{"count":250,"internal_anchors":7,"resolved_work":250,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"arXiv:2506.16791 [cs]","work_id":"155b5349-dee8-4870-965c-d54a700a19de","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Xgboost: A scalable tree boosting system","work_id":"c12cf8a8-1951-412c-a3cd-92de4cb10ca7","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Catboost: unbiased boosting with categorical features.Advances in neural information processing systems, 31, 2018","work_id":"cb38f37f-2ff1-4119-9239-170112c586b9","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Lightgbm: A highly efficient gradient boosting decision tree","work_id":"93734681-1fa2-4bd5-84b5-5c9c3dffda41","year":2017},{"cited_arxiv_id":"","doi":"10.1023/a","is_internal_anchor":false,"ref_index":5,"title":"Applying constraint satisfaction techniques to job shop scheduling , journal =","work_id":"82ab34d6-b79f-49d1-8128-5da36fe56174","year":2001}],"snapshot_sha256":"810ea16527aa8bc85ad81fb86abc7b1481632f43b39d8fab8c5d0722e7a3ba93"},"source":{"id":"2511.08667","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-15T04:09:59.122135Z","id":"e0c287a1-6ff9-4980-885b-57e1da827f05","model_set":{"reader":"grok-4.3"},"one_line_summary":"TabPFN-2.5 scales tabular foundation models to 20x larger datasets, outperforms tuned tree models on TabArena, achieves near-perfect win rates against default XGBoost, and adds a distillation engine for fast production deployment.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"TabPFN-2.5 scales tabular foundation models to 20 times more data cells and leads the TabArena benchmark.","strongest_claim":"default TabPFN-2.5 has a 100% win rate against default XGBoost on small to medium-sized classification datasets (<=10,000 data points, 500 features) and a 87% win rate on larger datasets up to 100K samples and 2K features (85% for regression).","weakest_assumption":"That the reported win rates and benchmark leadership on TabArena will generalize to new, unseen datasets outside the benchmark collection and that the training procedure does not contain undisclosed hyperparameter advantages."}},"verdict_id":"e0c287a1-6ff9-4980-885b-57e1da827f05"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dd53e66f8b3626d2e1d16852fb984fea3295394e1b9080b9614b5a10eccba4e7","target":"record","created_at":"2026-05-17T23:38:53Z","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":"34d2eb8cbaa7899adab58fe896c619c419da6ad5a95e700f54d3bf64098685d6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-11T18:57:15Z","title_canon_sha256":"3237b357c6bb4bfa8fd6e8fa85eaf5e2d5d077dacfe3e658bce83dcd9adcc2b2"},"schema_version":"1.0","source":{"id":"2511.08667","kind":"arxiv","version":2}},"canonical_sha256":"7e8041627cb8ef5b7aeb8a1d1520707ca72c006a8dd784ad25a232dea2aa2ea1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e8041627cb8ef5b7aeb8a1d1520707ca72c006a8dd784ad25a232dea2aa2ea1","first_computed_at":"2026-05-17T23:38:53.573895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:53.573895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9ttoUZyduho0rezoAiUSMZFGAhKtLhCpg3OknvZyQ8o8vSTsP4SgcUlpq9VZ4jYyTQ5i2WHde0kfQh580QXLDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:53.574576Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.08667","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd53e66f8b3626d2e1d16852fb984fea3295394e1b9080b9614b5a10eccba4e7","sha256:bb9e2bf22bc3fb04888c6bfe8a480268d8e49bfc6acd20d3506105d13f60b2dc"],"state_sha256":"e004f6a9da1c3d8f4231513193b57a81d09bfc7d1a0a58858734e96eb0a5b91a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7S5M+Sh5ClWw6p6T0zRTQvwgDASmXK+1q/FX0QQLhY6TUrAMBSaNbi+FoNhXuv+dS6Lp+ut7wbzVb7zKb+JCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:12:35.873101Z","bundle_sha256":"a4866f9b793e8e1db8ca14cb6fe8081f346bce14236efe68217fa787835638b9"}}