{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:V7VZMQQJPBUSD7TAVMQ2LTVV53","short_pith_number":"pith:V7VZMQQJ","canonical_record":{"source":{"id":"2602.23342","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2026-02-26T18:48:29Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"bcf48dc815aace3d2c369f80d0816c0e58f2fc24f40f5308e715657278a127a6","abstract_canon_sha256":"71ad4d3936bcb397c32c25e0124621a37602019a59bee0d55661e850956e2c60"},"schema_version":"1.0"},"canonical_sha256":"afeb964209786921fe60ab21a5ceb5eed54898aa93884d87e30d349995924cd4","source":{"kind":"arxiv","id":"2602.23342","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.23342","created_at":"2026-05-17T23:39:15Z"},{"alias_kind":"arxiv_version","alias_value":"2602.23342v2","created_at":"2026-05-17T23:39:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.23342","created_at":"2026-05-17T23:39:15Z"},{"alias_kind":"pith_short_12","alias_value":"V7VZMQQJPBUS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"V7VZMQQJPBUSD7TA","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"V7VZMQQJ","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:V7VZMQQJPBUSD7TAVMQ2LTVV53","target":"record","payload":{"canonical_record":{"source":{"id":"2602.23342","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2026-02-26T18:48:29Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"bcf48dc815aace3d2c369f80d0816c0e58f2fc24f40f5308e715657278a127a6","abstract_canon_sha256":"71ad4d3936bcb397c32c25e0124621a37602019a59bee0d55661e850956e2c60"},"schema_version":"1.0"},"canonical_sha256":"afeb964209786921fe60ab21a5ceb5eed54898aa93884d87e30d349995924cd4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:15.925833Z","signature_b64":"GwYXaW1JG38k3KxZDcJuV7n+V1VrW66sU4c5E5fRmB4H+VQ8N+IBImv5YrAWAv7Xy4BIOcP9uPliYL2Gm532Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afeb964209786921fe60ab21a5ceb5eed54898aa93884d87e30d349995924cd4","last_reissued_at":"2026-05-17T23:39:15.924874Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:15.924874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.23342","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:39:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N3vYfQYTKHORdjGUcPBSfkq+bsE79vpB9UssLLGcdF1auE+9e20EO4RxTlKb2w5SC7eTrjN/XtRK5SoEOoM6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:38:02.246488Z"},"content_sha256":"3a5fc93284de23de2fb166a5a53b201b68952a36f5a65e2aa8d2d0a66699a161","schema_version":"1.0","event_id":"sha256:3a5fc93284de23de2fb166a5a53b201b68952a36f5a65e2aa8d2d0a66699a161"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:V7VZMQQJPBUSD7TAVMQ2LTVV53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"AlayaLaser: Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"AlayaLaser shows that on-disk graph indexes for high-dimensional vectors can match or beat in-memory speed by fixing compute bottlenecks instead of chasing I/O savings.","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"Bo Tang, Gezi Li, Haotian Liu, Liang Huang, Long Xiang, Weijian Chen, Yangshen Deng","submitted_at":"2026-02-26T18:48:29Z","abstract_excerpt":"On-disk graph-based approximate nearest neighbor search (ANNS) is essential for large-scale, high-dimensional vector retrieval, yet its performance is widely recognized to be limited by the prohibitive I/O costs. Interestingly, we observed that the performance of on-disk graph-based index systems is compute-bound, not I/O-bound, with the rising of the vector data dimensionality (e.g., hundreds or thousands). This insight uncovers a significant optimization opportunity: existing on-disk graph-based index systems universally target I/O reduction and largely overlook computational overhead, which"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"AlayaLaser not only surpasses existing on-disk graph-based index systems but also matches or even exceeds the performance of in-memory index systems.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the performance bottleneck of existing on-disk graph-based systems is primarily compute-bound rather than I/O-bound once dimensionality reaches hundreds or thousands, and that the proposed SIMD-friendly layout plus heuristics will reliably translate this insight into measurable gains across datasets.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"AlayaLaser uses a SIMD-optimized on-disk graph layout plus caching and search strategies to outperform prior on-disk ANNS systems and match or exceed in-memory performance on large high-dimensional datasets.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"AlayaLaser shows that on-disk graph indexes for high-dimensional vectors can match or beat in-memory speed by fixing compute bottlenecks instead of chasing I/O savings.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"66d5b20224ed74510a39e3bdbde4405b20f46c7cc9da453bf7eea6de6bc8dc71"},"source":{"id":"2602.23342","kind":"arxiv","version":2},"verdict":{"id":"76efd490-bb14-43ce-9a50-4c2f00bb1c4d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T18:41:56.212217Z","strongest_claim":"AlayaLaser not only surpasses existing on-disk graph-based index systems but also matches or even exceeds the performance of in-memory index systems.","one_line_summary":"AlayaLaser uses a SIMD-optimized on-disk graph layout plus caching and search strategies to outperform prior on-disk ANNS systems and match or exceed in-memory performance on large high-dimensional datasets.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the performance bottleneck of existing on-disk graph-based systems is primarily compute-bound rather than I/O-bound once dimensionality reaches hundreds or thousands, and that the proposed SIMD-friendly layout plus heuristics will reliably translate this insight into measurable gains across datasets.","pith_extraction_headline":"AlayaLaser shows that on-disk graph indexes for high-dimensional vectors can match or beat in-memory speed by fixing compute bottlenecks instead of chasing I/O savings."},"references":{"count":58,"sample":[{"doi":"","year":2023,"title":"Cecilia Aguerrebere, Ishwar Bhati, Mark Hildebrand, Mariano Tepper, and Ted Willke. 2023. Similarity search in the blink of an eye with compressed indices. arXiv preprint arXiv:2304.04759(2023)","work_id":"dc14ca5e-4004-4560-a6df-a5e4faad08cb","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Fabien André, Anne-Marie Kermarrec, and Nicolas Le Scouarnec. 2017. Acceler- ated nearest neighbor search with quick adc. InICMR. 159–166","work_id":"e44c49f8-482f-47fd-87f4-4a64f54dfc1d","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"Fabien André, Anne-Marie Kermarrec, and Nicolas Le Scouarnec. 2019. Quicker adc: Unlocking the hidden potential of product quantization with simd.TPAMI 43, 5 (2019), 1666–1677","work_id":"6947de8e-5999-48be-a704-842186fd91fd","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Argilla. 2024. PersonaHub-FineWeb-Edu-4-Embeddings. Hugging Face dataset.https://huggingface.co/datasets/argilla-warehouse/personahub- fineweb-edu-4-embeddingsAccessed: 2025-10-06","work_id":"c109a04b-060b-4a6a-9814-9d333587c68f","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Martin Aumüller, Erik Bernhardsson, and Alexander Faithfull. 2020. ANN- Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms. Information Systems87 (2020), 101374","work_id":"63a4a9b9-0e11-4e11-a0cc-e335ac7e45ae","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":58,"snapshot_sha256":"876ae6af4c57566c0272993f13f44d5517d53eb37f60f144c3773e8998a4b83a","internal_anchors":2},"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":"76efd490-bb14-43ce-9a50-4c2f00bb1c4d"},"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:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QWhi1FGYF0AgAcS9Zf8GB7mlKXU6ikD4nfWHKMt08ZHMKll49HWaCyp/tN82SnxnMEEvWYzCX2wHYLmHaadeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:38:02.247645Z"},"content_sha256":"400e16a8607169ddb1674f9138ccf7ad53e5d8c595704c9b6c9c06492f34cf56","schema_version":"1.0","event_id":"sha256:400e16a8607169ddb1674f9138ccf7ad53e5d8c595704c9b6c9c06492f34cf56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V7VZMQQJPBUSD7TAVMQ2LTVV53/bundle.json","state_url":"https://pith.science/pith/V7VZMQQJPBUSD7TAVMQ2LTVV53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V7VZMQQJPBUSD7TAVMQ2LTVV53/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-27T02:38:02Z","links":{"resolver":"https://pith.science/pith/V7VZMQQJPBUSD7TAVMQ2LTVV53","bundle":"https://pith.science/pith/V7VZMQQJPBUSD7TAVMQ2LTVV53/bundle.json","state":"https://pith.science/pith/V7VZMQQJPBUSD7TAVMQ2LTVV53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V7VZMQQJPBUSD7TAVMQ2LTVV53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:V7VZMQQJPBUSD7TAVMQ2LTVV53","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":"71ad4d3936bcb397c32c25e0124621a37602019a59bee0d55661e850956e2c60","cross_cats_sorted":["cs.IR"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2026-02-26T18:48:29Z","title_canon_sha256":"bcf48dc815aace3d2c369f80d0816c0e58f2fc24f40f5308e715657278a127a6"},"schema_version":"1.0","source":{"id":"2602.23342","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.23342","created_at":"2026-05-17T23:39:15Z"},{"alias_kind":"arxiv_version","alias_value":"2602.23342v2","created_at":"2026-05-17T23:39:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.23342","created_at":"2026-05-17T23:39:15Z"},{"alias_kind":"pith_short_12","alias_value":"V7VZMQQJPBUS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"V7VZMQQJPBUSD7TA","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"V7VZMQQJ","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:400e16a8607169ddb1674f9138ccf7ad53e5d8c595704c9b6c9c06492f34cf56","target":"graph","created_at":"2026-05-17T23:39:15Z","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":"AlayaLaser not only surpasses existing on-disk graph-based index systems but also matches or even exceeds the performance of in-memory index systems."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the performance bottleneck of existing on-disk graph-based systems is primarily compute-bound rather than I/O-bound once dimensionality reaches hundreds or thousands, and that the proposed SIMD-friendly layout plus heuristics will reliably translate this insight into measurable gains across datasets."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"AlayaLaser uses a SIMD-optimized on-disk graph layout plus caching and search strategies to outperform prior on-disk ANNS systems and match or exceed in-memory performance on large high-dimensional datasets."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"AlayaLaser shows that on-disk graph indexes for high-dimensional vectors can match or beat in-memory speed by fixing compute bottlenecks instead of chasing I/O savings."}],"snapshot_sha256":"66d5b20224ed74510a39e3bdbde4405b20f46c7cc9da453bf7eea6de6bc8dc71"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"On-disk graph-based approximate nearest neighbor search (ANNS) is essential for large-scale, high-dimensional vector retrieval, yet its performance is widely recognized to be limited by the prohibitive I/O costs. Interestingly, we observed that the performance of on-disk graph-based index systems is compute-bound, not I/O-bound, with the rising of the vector data dimensionality (e.g., hundreds or thousands). This insight uncovers a significant optimization opportunity: existing on-disk graph-based index systems universally target I/O reduction and largely overlook computational overhead, which","authors_text":"Bo Tang, Gezi Li, Haotian Liu, Liang Huang, Long Xiang, Weijian Chen, Yangshen Deng","cross_cats":["cs.IR"],"headline":"AlayaLaser shows that on-disk graph indexes for high-dimensional vectors can match or beat in-memory speed by fixing compute bottlenecks instead of chasing I/O savings.","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2026-02-26T18:48:29Z","title":"AlayaLaser: Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search"},"references":{"count":58,"internal_anchors":2,"resolved_work":58,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Cecilia Aguerrebere, Ishwar Bhati, Mark Hildebrand, Mariano Tepper, and Ted Willke. 2023. Similarity search in the blink of an eye with compressed indices. arXiv preprint arXiv:2304.04759(2023)","work_id":"dc14ca5e-4004-4560-a6df-a5e4faad08cb","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Fabien André, Anne-Marie Kermarrec, and Nicolas Le Scouarnec. 2017. Acceler- ated nearest neighbor search with quick adc. InICMR. 159–166","work_id":"e44c49f8-482f-47fd-87f4-4a64f54dfc1d","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Fabien André, Anne-Marie Kermarrec, and Nicolas Le Scouarnec. 2019. Quicker adc: Unlocking the hidden potential of product quantization with simd.TPAMI 43, 5 (2019), 1666–1677","work_id":"6947de8e-5999-48be-a704-842186fd91fd","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Argilla. 2024. PersonaHub-FineWeb-Edu-4-Embeddings. Hugging Face dataset.https://huggingface.co/datasets/argilla-warehouse/personahub- fineweb-edu-4-embeddingsAccessed: 2025-10-06","work_id":"c109a04b-060b-4a6a-9814-9d333587c68f","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Martin Aumüller, Erik Bernhardsson, and Alexander Faithfull. 2020. ANN- Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms. Information Systems87 (2020), 101374","work_id":"63a4a9b9-0e11-4e11-a0cc-e335ac7e45ae","year":2020}],"snapshot_sha256":"876ae6af4c57566c0272993f13f44d5517d53eb37f60f144c3773e8998a4b83a"},"source":{"id":"2602.23342","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-15T18:41:56.212217Z","id":"76efd490-bb14-43ce-9a50-4c2f00bb1c4d","model_set":{"reader":"grok-4.3"},"one_line_summary":"AlayaLaser uses a SIMD-optimized on-disk graph layout plus caching and search strategies to outperform prior on-disk ANNS systems and match or exceed in-memory performance on large high-dimensional datasets.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"AlayaLaser shows that on-disk graph indexes for high-dimensional vectors can match or beat in-memory speed by fixing compute bottlenecks instead of chasing I/O savings.","strongest_claim":"AlayaLaser not only surpasses existing on-disk graph-based index systems but also matches or even exceeds the performance of in-memory index systems.","weakest_assumption":"That the performance bottleneck of existing on-disk graph-based systems is primarily compute-bound rather than I/O-bound once dimensionality reaches hundreds or thousands, and that the proposed SIMD-friendly layout plus heuristics will reliably translate this insight into measurable gains across datasets."}},"verdict_id":"76efd490-bb14-43ce-9a50-4c2f00bb1c4d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3a5fc93284de23de2fb166a5a53b201b68952a36f5a65e2aa8d2d0a66699a161","target":"record","created_at":"2026-05-17T23:39:15Z","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":"71ad4d3936bcb397c32c25e0124621a37602019a59bee0d55661e850956e2c60","cross_cats_sorted":["cs.IR"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2026-02-26T18:48:29Z","title_canon_sha256":"bcf48dc815aace3d2c369f80d0816c0e58f2fc24f40f5308e715657278a127a6"},"schema_version":"1.0","source":{"id":"2602.23342","kind":"arxiv","version":2}},"canonical_sha256":"afeb964209786921fe60ab21a5ceb5eed54898aa93884d87e30d349995924cd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afeb964209786921fe60ab21a5ceb5eed54898aa93884d87e30d349995924cd4","first_computed_at":"2026-05-17T23:39:15.924874Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:15.924874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GwYXaW1JG38k3KxZDcJuV7n+V1VrW66sU4c5E5fRmB4H+VQ8N+IBImv5YrAWAv7Xy4BIOcP9uPliYL2Gm532Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:15.925833Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.23342","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a5fc93284de23de2fb166a5a53b201b68952a36f5a65e2aa8d2d0a66699a161","sha256:400e16a8607169ddb1674f9138ccf7ad53e5d8c595704c9b6c9c06492f34cf56"],"state_sha256":"a25261b3d7ae2264e884130e2d9ce34516fbc6c387b88e05a0716e5394ffaba7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8LfpIybxLn5n34aWiSxVMXe0MPEUgME2jDwv3Fj5bn5I7nAcMSPtCKOpgdYtBuFncFLWXn+daVP6JcHqRjHBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:38:02.252390Z","bundle_sha256":"17aba9bfe033110fb4d54ffacf68a9793fa1b1585824da17fda2357e5000f795"}}