{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GBMUKCEFJCF6H6EWSM74QHUWOR","short_pith_number":"pith:GBMUKCEF","canonical_record":{"source":{"id":"2605.14145","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-13T21:52:05Z","cross_cats_sorted":[],"title_canon_sha256":"7c35b365c4225306ce8c4d8af3fbb23cc07acf09c84a677e007cd58fb8a1f88e","abstract_canon_sha256":"dd99c6eff52e9a35f8d1918b5ef78dab10ff93af0bee87c45d0cacd598ac9476"},"schema_version":"1.0"},"canonical_sha256":"3059450885488be3f896933fc81e9674691a33e6bea940d810484b4fd849ec77","source":{"kind":"arxiv","id":"2605.14145","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14145","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14145v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14145","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"GBMUKCEFJCF6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GBMUKCEFJCF6H6EW","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GBMUKCEF","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GBMUKCEFJCF6H6EWSM74QHUWOR","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14145","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-13T21:52:05Z","cross_cats_sorted":[],"title_canon_sha256":"7c35b365c4225306ce8c4d8af3fbb23cc07acf09c84a677e007cd58fb8a1f88e","abstract_canon_sha256":"dd99c6eff52e9a35f8d1918b5ef78dab10ff93af0bee87c45d0cacd598ac9476"},"schema_version":"1.0"},"canonical_sha256":"3059450885488be3f896933fc81e9674691a33e6bea940d810484b4fd849ec77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:11.638775Z","signature_b64":"5+WydVoY/XlwNpPXTVTx9sToFy0kRIrorBXxs6DUsj51b+RvH5hE8BYHZOgW1g+cC3GrCikqwO9TACGNx4njAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3059450885488be3f896933fc81e9674691a33e6bea940d810484b4fd849ec77","last_reissued_at":"2026-05-17T23:39:11.638172Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:11.638172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14145","source_version":1,"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:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xTL4Ul8VlI3NWIHPHtSVH/tCiGKLM1Gw6w60YxzkwO1gpnpWygiaOlj1LoaYrs+6JQx4aEp91tF2c+3TWCUgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:20:27.831786Z"},"content_sha256":"26d2720c625fb037757354165a1b6d2dd77f76645cd6f7ee90de6d18c5c974f1","schema_version":"1.0","event_id":"sha256:26d2720c625fb037757354165a1b6d2dd77f76645cd6f7ee90de6d18c5c974f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GBMUKCEFJCF6H6EWSM74QHUWOR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rethinking the Good Enough Embedding for Easy Few-Shot Learning","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"A frozen DINOv2 embedding paired with k-nearest neighbor classification reaches state-of-the-art few-shot accuracy without any fine-tuning.","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alper Yilmaz, Michael Karnes","submitted_at":"2026-05-13T21:52:05Z","abstract_excerpt":"The field of deep visual recognition is undergoing a paradigm shift toward universal representations. The Platonic Representation Hypothesis suggests that diverse architectures trained on massive datasets are converging toward a shared, \"ideal\" latent space. This again raises a critical question: is a \"Good Embedding All You Need?\" In this paper, we leverage this convergence to demonstrate that off-the-shelf embeddings are inherently \"good enough\" for complex tasks, rendering intensive task-specific fine-tuning unnecessary. We explore this hypothesis within the few-shot learning framework, pro"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"By utilizing a k-Nearest Neighbor classifier on frozen DINOv2-L features, we conduct a layer-wise characterization to identify an optimal feature extraction. We further demonstrate that manifold refinement via PCA and ICA provides a beneficial regularizing effect. Our results across four major benchmarks demonstrate that our approach consistently surpasses sophisticated meta-learning algorithms, achieving state-of-the-art performance.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that DINOv2 features already form a sufficiently universal and task-agnostic representation so that no task-specific adaptation or learned metric is required; this is invoked when claiming the frozen embedding plus k-NN is 'good enough' for complex tasks.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Frozen DINOv2-L features with k-NN classification and PCA/ICA refinement achieve state-of-the-art few-shot performance on four benchmarks without any backpropagation or fine-tuning.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A frozen DINOv2 embedding paired with k-nearest neighbor classification reaches state-of-the-art few-shot accuracy without any fine-tuning.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1d31205e12aa52549e2b7d680ec6c14c850bafb7d2abcab36429f5d28d2d3258"},"source":{"id":"2605.14145","kind":"arxiv","version":1},"verdict":{"id":"b85ad5ee-4c7c-4f2b-9f2c-a45d9f6eaf33","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T04:51:53.330394Z","strongest_claim":"By utilizing a k-Nearest Neighbor classifier on frozen DINOv2-L features, we conduct a layer-wise characterization to identify an optimal feature extraction. We further demonstrate that manifold refinement via PCA and ICA provides a beneficial regularizing effect. Our results across four major benchmarks demonstrate that our approach consistently surpasses sophisticated meta-learning algorithms, achieving state-of-the-art performance.","one_line_summary":"Frozen DINOv2-L features with k-NN classification and PCA/ICA refinement achieve state-of-the-art few-shot performance on four benchmarks without any backpropagation or fine-tuning.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that DINOv2 features already form a sufficiently universal and task-agnostic representation so that no task-specific adaptation or learned metric is required; this is invoked when claiming the frozen embedding plus k-NN is 'good enough' for complex tasks.","pith_extraction_headline":"A frozen DINOv2 embedding paired with k-nearest neighbor classification reaches state-of-the-art few-shot accuracy without any fine-tuning."},"references":{"count":46,"sample":[{"doi":"","year":2020,"title":"Bateni, P., Goyal, R., Masrani, V., Wood, F., Sigal, L.: Improved few-shot visual classification (2020),https://arxiv.org/abs/1912.03432","work_id":"d602bd10-34f9-4848-b606-06d55a828d21","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Chen, W., Si, C., Zhang, Z., Wang, L., Wang, Z., Tan, T.: Semantic prompt for few-shot image recognition (2023),https://arxiv.org/abs/2303.14123","work_id":"92fee499-ca27-44f5-b3d0-35f0c3dbf56e","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Chen, Y., Liu, Z., Xu, H., Darrell, T., Wang, X.: Meta-baseline: Exploring simple meta-learning for few-shot learning (2021),https://arxiv.org/abs/2003.04390","work_id":"ad9fe5ef-a9d3-4289-8b62-96cdc0ccecb0","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/iccv51070","year":2023,"title":"st + 1 K KX k=1 vt k # =E t","work_id":"c82688eb-98da-44ce-8f90-cf2ac44cd408","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/978-3-031-20044-1_19","year":2022,"title":"In: Computer Vision – ECCV 2022: 17th European Conference, Tel Aviv, Israel, October 23–27, 2022, Proceedings, Part XX","work_id":"4aae9c62-970d-4340-a3c5-572c624c6f52","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":46,"snapshot_sha256":"ebb29b23ce0d2521dcbf4b3715549b28bf655c2941b3ffc4643221cd328ede64","internal_anchors":4},"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":"b85ad5ee-4c7c-4f2b-9f2c-a45d9f6eaf33"},"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:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iw5gRG8B9t44KQL8EnEz8KzjrUUNxBULslN1+mIszw/Eofb446xg1lQ5Fyu2NDsSs/3bUNyWI05kT/N4blSuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:20:27.832493Z"},"content_sha256":"c2cb57d2e5d3caa06cac83d5d63002c07f19cc7d683ce676ac06b01ac6ac4cb2","schema_version":"1.0","event_id":"sha256:c2cb57d2e5d3caa06cac83d5d63002c07f19cc7d683ce676ac06b01ac6ac4cb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GBMUKCEFJCF6H6EWSM74QHUWOR/bundle.json","state_url":"https://pith.science/pith/GBMUKCEFJCF6H6EWSM74QHUWOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GBMUKCEFJCF6H6EWSM74QHUWOR/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-06-08T13:20:27Z","links":{"resolver":"https://pith.science/pith/GBMUKCEFJCF6H6EWSM74QHUWOR","bundle":"https://pith.science/pith/GBMUKCEFJCF6H6EWSM74QHUWOR/bundle.json","state":"https://pith.science/pith/GBMUKCEFJCF6H6EWSM74QHUWOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GBMUKCEFJCF6H6EWSM74QHUWOR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GBMUKCEFJCF6H6EWSM74QHUWOR","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":"dd99c6eff52e9a35f8d1918b5ef78dab10ff93af0bee87c45d0cacd598ac9476","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-13T21:52:05Z","title_canon_sha256":"7c35b365c4225306ce8c4d8af3fbb23cc07acf09c84a677e007cd58fb8a1f88e"},"schema_version":"1.0","source":{"id":"2605.14145","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14145","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14145v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14145","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"GBMUKCEFJCF6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GBMUKCEFJCF6H6EW","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GBMUKCEF","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:c2cb57d2e5d3caa06cac83d5d63002c07f19cc7d683ce676ac06b01ac6ac4cb2","target":"graph","created_at":"2026-05-17T23:39:11Z","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":"By utilizing a k-Nearest Neighbor classifier on frozen DINOv2-L features, we conduct a layer-wise characterization to identify an optimal feature extraction. We further demonstrate that manifold refinement via PCA and ICA provides a beneficial regularizing effect. Our results across four major benchmarks demonstrate that our approach consistently surpasses sophisticated meta-learning algorithms, achieving state-of-the-art performance."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that DINOv2 features already form a sufficiently universal and task-agnostic representation so that no task-specific adaptation or learned metric is required; this is invoked when claiming the frozen embedding plus k-NN is 'good enough' for complex tasks."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Frozen DINOv2-L features with k-NN classification and PCA/ICA refinement achieve state-of-the-art few-shot performance on four benchmarks without any backpropagation or fine-tuning."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A frozen DINOv2 embedding paired with k-nearest neighbor classification reaches state-of-the-art few-shot accuracy without any fine-tuning."}],"snapshot_sha256":"1d31205e12aa52549e2b7d680ec6c14c850bafb7d2abcab36429f5d28d2d3258"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The field of deep visual recognition is undergoing a paradigm shift toward universal representations. The Platonic Representation Hypothesis suggests that diverse architectures trained on massive datasets are converging toward a shared, \"ideal\" latent space. This again raises a critical question: is a \"Good Embedding All You Need?\" In this paper, we leverage this convergence to demonstrate that off-the-shelf embeddings are inherently \"good enough\" for complex tasks, rendering intensive task-specific fine-tuning unnecessary. We explore this hypothesis within the few-shot learning framework, pro","authors_text":"Alper Yilmaz, Michael Karnes","cross_cats":[],"headline":"A frozen DINOv2 embedding paired with k-nearest neighbor classification reaches state-of-the-art few-shot accuracy without any fine-tuning.","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-13T21:52:05Z","title":"Rethinking the Good Enough Embedding for Easy Few-Shot Learning"},"references":{"count":46,"internal_anchors":4,"resolved_work":46,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Bateni, P., Goyal, R., Masrani, V., Wood, F., Sigal, L.: Improved few-shot visual classification (2020),https://arxiv.org/abs/1912.03432","work_id":"d602bd10-34f9-4848-b606-06d55a828d21","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Chen, W., Si, C., Zhang, Z., Wang, L., Wang, Z., Tan, T.: Semantic prompt for few-shot image recognition (2023),https://arxiv.org/abs/2303.14123","work_id":"92fee499-ca27-44f5-b3d0-35f0c3dbf56e","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Chen, Y., Liu, Z., Xu, H., Darrell, T., Wang, X.: Meta-baseline: Exploring simple meta-learning for few-shot learning (2021),https://arxiv.org/abs/2003.04390","work_id":"ad9fe5ef-a9d3-4289-8b62-96cdc0ccecb0","year":2021},{"cited_arxiv_id":"","doi":"10.1109/iccv51070","is_internal_anchor":false,"ref_index":4,"title":"st + 1 K KX k=1 vt k # =E t","work_id":"c82688eb-98da-44ce-8f90-cf2ac44cd408","year":2023},{"cited_arxiv_id":"","doi":"10.1007/978-3-031-20044-1_19","is_internal_anchor":false,"ref_index":5,"title":"In: Computer Vision – ECCV 2022: 17th European Conference, Tel Aviv, Israel, October 23–27, 2022, Proceedings, Part XX","work_id":"4aae9c62-970d-4340-a3c5-572c624c6f52","year":2022}],"snapshot_sha256":"ebb29b23ce0d2521dcbf4b3715549b28bf655c2941b3ffc4643221cd328ede64"},"source":{"id":"2605.14145","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T04:51:53.330394Z","id":"b85ad5ee-4c7c-4f2b-9f2c-a45d9f6eaf33","model_set":{"reader":"grok-4.3"},"one_line_summary":"Frozen DINOv2-L features with k-NN classification and PCA/ICA refinement achieve state-of-the-art few-shot performance on four benchmarks without any backpropagation or fine-tuning.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A frozen DINOv2 embedding paired with k-nearest neighbor classification reaches state-of-the-art few-shot accuracy without any fine-tuning.","strongest_claim":"By utilizing a k-Nearest Neighbor classifier on frozen DINOv2-L features, we conduct a layer-wise characterization to identify an optimal feature extraction. We further demonstrate that manifold refinement via PCA and ICA provides a beneficial regularizing effect. Our results across four major benchmarks demonstrate that our approach consistently surpasses sophisticated meta-learning algorithms, achieving state-of-the-art performance.","weakest_assumption":"The assumption that DINOv2 features already form a sufficiently universal and task-agnostic representation so that no task-specific adaptation or learned metric is required; this is invoked when claiming the frozen embedding plus k-NN is 'good enough' for complex tasks."}},"verdict_id":"b85ad5ee-4c7c-4f2b-9f2c-a45d9f6eaf33"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:26d2720c625fb037757354165a1b6d2dd77f76645cd6f7ee90de6d18c5c974f1","target":"record","created_at":"2026-05-17T23:39:11Z","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":"dd99c6eff52e9a35f8d1918b5ef78dab10ff93af0bee87c45d0cacd598ac9476","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-13T21:52:05Z","title_canon_sha256":"7c35b365c4225306ce8c4d8af3fbb23cc07acf09c84a677e007cd58fb8a1f88e"},"schema_version":"1.0","source":{"id":"2605.14145","kind":"arxiv","version":1}},"canonical_sha256":"3059450885488be3f896933fc81e9674691a33e6bea940d810484b4fd849ec77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3059450885488be3f896933fc81e9674691a33e6bea940d810484b4fd849ec77","first_computed_at":"2026-05-17T23:39:11.638172Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:11.638172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5+WydVoY/XlwNpPXTVTx9sToFy0kRIrorBXxs6DUsj51b+RvH5hE8BYHZOgW1g+cC3GrCikqwO9TACGNx4njAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:11.638775Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14145","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26d2720c625fb037757354165a1b6d2dd77f76645cd6f7ee90de6d18c5c974f1","sha256:c2cb57d2e5d3caa06cac83d5d63002c07f19cc7d683ce676ac06b01ac6ac4cb2"],"state_sha256":"03a5011f68c5ac6ed15be583bce337da4b4158a63e13fb82cb8a55ad422bfcbf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mkjZCPzgmOQLWxPGhKm9FTylKF28fUdZc9u8En+hEeEZabO+UUJVqDi8j8tLcELTF1AFgeEBVTB+ceH/lg01Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:20:27.835822Z","bundle_sha256":"a03fa420e58f87264a38fe086186d2f50def2e78a2b8ca4c5750cd5b257eb78b"}}