{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:R3YVECNIHV2XT6BW3BYTNCLMGG","short_pith_number":"pith:R3YVECNI","canonical_record":{"source":{"id":"2605.15950","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-15T13:41:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"520f5a959f6f0a75bc918b30c963dc4235b844a14b9a71d967403606e3818b56","abstract_canon_sha256":"15c7b8dce39ff727871642bf95e700bfd3f45e2d999c13c2bd7582ea5dabe180"},"schema_version":"1.0"},"canonical_sha256":"8ef15209a83d7579f836d87136896c319ab573f4e0372889da7d25af2dd144a3","source":{"kind":"arxiv","id":"2605.15950","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15950","created_at":"2026-05-20T00:01:46Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15950v1","created_at":"2026-05-20T00:01:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15950","created_at":"2026-05-20T00:01:46Z"},{"alias_kind":"pith_short_12","alias_value":"R3YVECNIHV2X","created_at":"2026-05-20T00:01:46Z"},{"alias_kind":"pith_short_16","alias_value":"R3YVECNIHV2XT6BW","created_at":"2026-05-20T00:01:46Z"},{"alias_kind":"pith_short_8","alias_value":"R3YVECNI","created_at":"2026-05-20T00:01:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:R3YVECNIHV2XT6BW3BYTNCLMGG","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15950","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-15T13:41:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"520f5a959f6f0a75bc918b30c963dc4235b844a14b9a71d967403606e3818b56","abstract_canon_sha256":"15c7b8dce39ff727871642bf95e700bfd3f45e2d999c13c2bd7582ea5dabe180"},"schema_version":"1.0"},"canonical_sha256":"8ef15209a83d7579f836d87136896c319ab573f4e0372889da7d25af2dd144a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:46.299330Z","signature_b64":"rOhRg35cZ/iXRqGX3HAXkhYKmXDJv7muQmT6/dnGfNFvxoBdT3lNFCgIwIk9RY0HrLoxD+HwvJ643i9F8iE+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ef15209a83d7579f836d87136896c319ab573f4e0372889da7d25af2dd144a3","last_reissued_at":"2026-05-20T00:01:46.298684Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:46.298684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15950","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-20T00:01:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Njb0en9Ub/J9ZOZx0tCmuH988vLcGGYQvXBdHhYuA1iM3asgdqRra1cNvgh2fefC05lShWKc8CQqyRl7n/pKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:41:13.693015Z"},"content_sha256":"e3954783fc41034d294a71a36fbbb77ae6f4d4af8cdd9392fc4abe0fd84e2641","schema_version":"1.0","event_id":"sha256:e3954783fc41034d294a71a36fbbb77ae6f4d4af8cdd9392fc4abe0fd84e2641"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:R3YVECNIHV2XT6BW3BYTNCLMGG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","license":"http://creativecommons.org/licenses/by/4.0/","headline":"For in-block memory channels the optimal vectorized generalized nearest neighbor decoder admits an analytical characterization when Gaussian codebooks are employed.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hao Wu, Shuqin Pang, Wenyi Zhang, Xinwei Li, Yuhao Liu","submitted_at":"2026-05-15T13:41:19Z","abstract_excerpt":"This work extends the generalized nearest neighbor decoding (GNND), originally developed as a receiver architecture for memoryless channels, to a vectorized GNND (Vec-GNND) suitable for in-block memory (IBM) channels. Leveraging the generalized mutual information (GMI) as an operational lower bound on the mismatch capacity, an analytical characterization of the optimal Vec-GNND is obtained for general IBM channels with Gaussian codebooks. The formalism further provides closed-form optimality conditions and achievable GMIs for restricted variants of the receiver architecture. Furthermore, we fo"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Leveraging the generalized mutual information (GMI) as an operational lower bound on the mismatch capacity, an analytical characterization of the optimal Vec-GNND is obtained for general IBM channels with Gaussian codebooks. The formalism further provides closed-form optimality conditions and achievable GMIs for restricted variants of the receiver architecture.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That Gaussian codebooks are employed and that the GMI lower bound remains sufficiently tight to characterize optimality for the vectorized receiver on general IBM channels (abstract, paragraph 2).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Vec-GNND yields closed-form optimality conditions and achievable GMIs for IBM channels with Gaussian codebooks, plus a GMI-based joint covariance-metric design that reduces to covariance optimization.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"For in-block memory channels the optimal vectorized generalized nearest neighbor decoder admits an analytical characterization when Gaussian codebooks are employed.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3c892b6767c2f73bbd466379fdc205857a207f0d1f081b3daf7e5836bdca0f73"},"source":{"id":"2605.15950","kind":"arxiv","version":1},"verdict":{"id":"83a0c232-bb9a-4b66-bdd3-3bd810cd1d6c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:28:17.182306Z","strongest_claim":"Leveraging the generalized mutual information (GMI) as an operational lower bound on the mismatch capacity, an analytical characterization of the optimal Vec-GNND is obtained for general IBM channels with Gaussian codebooks. The formalism further provides closed-form optimality conditions and achievable GMIs for restricted variants of the receiver architecture.","one_line_summary":"Vec-GNND yields closed-form optimality conditions and achievable GMIs for IBM channels with Gaussian codebooks, plus a GMI-based joint covariance-metric design that reduces to covariance optimization.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That Gaussian codebooks are employed and that the GMI lower bound remains sufficiently tight to characterize optimality for the vectorized receiver on general IBM channels (abstract, paragraph 2).","pith_extraction_headline":"For in-block memory channels the optimal vectorized generalized nearest neighbor decoder admits an analytical characterization when Gaussian codebooks are employed."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15950/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:19.110769Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:40:54.467657Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:44.881486Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:01:55.714709Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"a4b8d24bb96f97b859a2ac002385e90284eaee3680c0d08855403edc2dc87859"},"references":{"count":49,"sample":[{"doi":"","year":1948,"title":"A mathematical theory of communication,","work_id":"59e0a64d-9f40-470e-81bc-784fdf0fe462","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1965,"title":"I. M. Jacobs and J. Wozencraft,Principles of communication engineering.New York, NY , USA: Wiley, 1965","work_id":"669d7fcc-3141-4855-8ec4-2ca5dca70308","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"Massive MIMO systems with non-ideal hardware: Energy efficiency, estimation, and capacity limits,","work_id":"e71323e6-e8dc-43ac-ba5a-cfe483fe3b28","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2002,"title":"Reliable communication under channel uncertainty,","work_id":"59c82639-c0f0-4994-b5be-28f0af82f524","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"Mismatched decoding: Error exponents, second-order rates and saddlepoint approximations,","work_id":"c414331d-a491-4d0b-afb5-b32e0956fafd","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":49,"snapshot_sha256":"50b1afdbe8fddeee578d6b19000677c81868dd6883c629fe320dfc2bd67383eb","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"72d59c91d5d2aba4b2dd66d4d558d7cbe218013eaebdf699fd89e6db8c117bcc"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"83a0c232-bb9a-4b66-bdd3-3bd810cd1d6c"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VspkcOhj58NU3RAFJBeOCQyqDDa2Pa+CSqtap/Ine3N1TUkAPBkJf3fiRxcFRlNjhnGq+3MMtm8+YoYFMDa5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:41:13.694179Z"},"content_sha256":"db35bce9c1ec9e709a69452fedf4094b12801000325a8010a4609798f13a1e72","schema_version":"1.0","event_id":"sha256:db35bce9c1ec9e709a69452fedf4094b12801000325a8010a4609798f13a1e72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3YVECNIHV2XT6BW3BYTNCLMGG/bundle.json","state_url":"https://pith.science/pith/R3YVECNIHV2XT6BW3BYTNCLMGG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3YVECNIHV2XT6BW3BYTNCLMGG/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-25T12:41:13Z","links":{"resolver":"https://pith.science/pith/R3YVECNIHV2XT6BW3BYTNCLMGG","bundle":"https://pith.science/pith/R3YVECNIHV2XT6BW3BYTNCLMGG/bundle.json","state":"https://pith.science/pith/R3YVECNIHV2XT6BW3BYTNCLMGG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3YVECNIHV2XT6BW3BYTNCLMGG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:R3YVECNIHV2XT6BW3BYTNCLMGG","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":"15c7b8dce39ff727871642bf95e700bfd3f45e2d999c13c2bd7582ea5dabe180","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-15T13:41:19Z","title_canon_sha256":"520f5a959f6f0a75bc918b30c963dc4235b844a14b9a71d967403606e3818b56"},"schema_version":"1.0","source":{"id":"2605.15950","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15950","created_at":"2026-05-20T00:01:46Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15950v1","created_at":"2026-05-20T00:01:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15950","created_at":"2026-05-20T00:01:46Z"},{"alias_kind":"pith_short_12","alias_value":"R3YVECNIHV2X","created_at":"2026-05-20T00:01:46Z"},{"alias_kind":"pith_short_16","alias_value":"R3YVECNIHV2XT6BW","created_at":"2026-05-20T00:01:46Z"},{"alias_kind":"pith_short_8","alias_value":"R3YVECNI","created_at":"2026-05-20T00:01:46Z"}],"graph_snapshots":[{"event_id":"sha256:db35bce9c1ec9e709a69452fedf4094b12801000325a8010a4609798f13a1e72","target":"graph","created_at":"2026-05-20T00:01:46Z","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":"Leveraging the generalized mutual information (GMI) as an operational lower bound on the mismatch capacity, an analytical characterization of the optimal Vec-GNND is obtained for general IBM channels with Gaussian codebooks. The formalism further provides closed-form optimality conditions and achievable GMIs for restricted variants of the receiver architecture."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That Gaussian codebooks are employed and that the GMI lower bound remains sufficiently tight to characterize optimality for the vectorized receiver on general IBM channels (abstract, paragraph 2)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Vec-GNND yields closed-form optimality conditions and achievable GMIs for IBM channels with Gaussian codebooks, plus a GMI-based joint covariance-metric design that reduces to covariance optimization."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"For in-block memory channels the optimal vectorized generalized nearest neighbor decoder admits an analytical characterization when Gaussian codebooks are employed."}],"snapshot_sha256":"3c892b6767c2f73bbd466379fdc205857a207f0d1f081b3daf7e5836bdca0f73"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"72d59c91d5d2aba4b2dd66d4d558d7cbe218013eaebdf699fd89e6db8c117bcc"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:19.110769Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:40:54.467657Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:44.881486Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T17:01:55.714709Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.15950/integrity.json","findings":[],"snapshot_sha256":"a4b8d24bb96f97b859a2ac002385e90284eaee3680c0d08855403edc2dc87859","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work extends the generalized nearest neighbor decoding (GNND), originally developed as a receiver architecture for memoryless channels, to a vectorized GNND (Vec-GNND) suitable for in-block memory (IBM) channels. Leveraging the generalized mutual information (GMI) as an operational lower bound on the mismatch capacity, an analytical characterization of the optimal Vec-GNND is obtained for general IBM channels with Gaussian codebooks. The formalism further provides closed-form optimality conditions and achievable GMIs for restricted variants of the receiver architecture. Furthermore, we fo","authors_text":"Hao Wu, Shuqin Pang, Wenyi Zhang, Xinwei Li, Yuhao Liu","cross_cats":["math.IT"],"headline":"For in-block memory channels the optimal vectorized generalized nearest neighbor decoder admits an analytical characterization when Gaussian codebooks are employed.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel"},"references":{"count":49,"internal_anchors":0,"resolved_work":49,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"A mathematical theory of communication,","work_id":"59e0a64d-9f40-470e-81bc-784fdf0fe462","year":1948},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"I. M. Jacobs and J. Wozencraft,Principles of communication engineering.New York, NY , USA: Wiley, 1965","work_id":"669d7fcc-3141-4855-8ec4-2ca5dca70308","year":1965},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Massive MIMO systems with non-ideal hardware: Energy efficiency, estimation, and capacity limits,","work_id":"e71323e6-e8dc-43ac-ba5a-cfe483fe3b28","year":2014},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Reliable communication under channel uncertainty,","work_id":"59c82639-c0f0-4994-b5be-28f0af82f524","year":2002},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Mismatched decoding: Error exponents, second-order rates and saddlepoint approximations,","work_id":"c414331d-a491-4d0b-afb5-b32e0956fafd","year":2014}],"snapshot_sha256":"50b1afdbe8fddeee578d6b19000677c81868dd6883c629fe320dfc2bd67383eb"},"source":{"id":"2605.15950","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T19:28:17.182306Z","id":"83a0c232-bb9a-4b66-bdd3-3bd810cd1d6c","model_set":{"reader":"grok-4.3"},"one_line_summary":"Vec-GNND yields closed-form optimality conditions and achievable GMIs for IBM channels with Gaussian codebooks, plus a GMI-based joint covariance-metric design that reduces to covariance optimization.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"For in-block memory channels the optimal vectorized generalized nearest neighbor decoder admits an analytical characterization when Gaussian codebooks are employed.","strongest_claim":"Leveraging the generalized mutual information (GMI) as an operational lower bound on the mismatch capacity, an analytical characterization of the optimal Vec-GNND is obtained for general IBM channels with Gaussian codebooks. The formalism further provides closed-form optimality conditions and achievable GMIs for restricted variants of the receiver architecture.","weakest_assumption":"That Gaussian codebooks are employed and that the GMI lower bound remains sufficiently tight to characterize optimality for the vectorized receiver on general IBM channels (abstract, paragraph 2)."}},"verdict_id":"83a0c232-bb9a-4b66-bdd3-3bd810cd1d6c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e3954783fc41034d294a71a36fbbb77ae6f4d4af8cdd9392fc4abe0fd84e2641","target":"record","created_at":"2026-05-20T00:01:46Z","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":"15c7b8dce39ff727871642bf95e700bfd3f45e2d999c13c2bd7582ea5dabe180","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-15T13:41:19Z","title_canon_sha256":"520f5a959f6f0a75bc918b30c963dc4235b844a14b9a71d967403606e3818b56"},"schema_version":"1.0","source":{"id":"2605.15950","kind":"arxiv","version":1}},"canonical_sha256":"8ef15209a83d7579f836d87136896c319ab573f4e0372889da7d25af2dd144a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ef15209a83d7579f836d87136896c319ab573f4e0372889da7d25af2dd144a3","first_computed_at":"2026-05-20T00:01:46.298684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:46.298684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rOhRg35cZ/iXRqGX3HAXkhYKmXDJv7muQmT6/dnGfNFvxoBdT3lNFCgIwIk9RY0HrLoxD+HwvJ643i9F8iE+CA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:46.299330Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15950","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3954783fc41034d294a71a36fbbb77ae6f4d4af8cdd9392fc4abe0fd84e2641","sha256:db35bce9c1ec9e709a69452fedf4094b12801000325a8010a4609798f13a1e72"],"state_sha256":"f611ff26f9f492677854199dfc66c7069d28ae8e015ca729c27cd617337227f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8L+jerJAtatVxyQkRrT0KtBTNIdwLdLO6vZyb89DBvf0O+pRUPYJew6zIfYAX2qmPq/DHmuvj/koetVsoOIsAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:41:13.699007Z","bundle_sha256":"668c8fe40ade7e413e61caf9fde9abe18516db9346c5eeb23d307e859423e0f6"}}