{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ENWG2XKPMCBSPT5H7Q5XXEX7HU","short_pith_number":"pith:ENWG2XKP","canonical_record":{"source":{"id":"2605.15393","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T20:26:59Z","cross_cats_sorted":[],"title_canon_sha256":"3084e86520bad1b69c41ebd76253a81e4cba3f8551ce75ec8cb122d6bad18f0c","abstract_canon_sha256":"1cef0907d0f498f145adbc8860fb3d834bef77895a396b62279f7af2a33f5c26"},"schema_version":"1.0"},"canonical_sha256":"236c6d5d4f608327cfa7fc3b7b92ff3d3f3550026e8e6c3cc78bcff3c97c5f66","source":{"kind":"arxiv","id":"2605.15393","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15393","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15393v1","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15393","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"pith_short_12","alias_value":"ENWG2XKPMCBS","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"pith_short_16","alias_value":"ENWG2XKPMCBSPT5H","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"pith_short_8","alias_value":"ENWG2XKP","created_at":"2026-05-20T00:00:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ENWG2XKPMCBSPT5H7Q5XXEX7HU","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15393","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T20:26:59Z","cross_cats_sorted":[],"title_canon_sha256":"3084e86520bad1b69c41ebd76253a81e4cba3f8551ce75ec8cb122d6bad18f0c","abstract_canon_sha256":"1cef0907d0f498f145adbc8860fb3d834bef77895a396b62279f7af2a33f5c26"},"schema_version":"1.0"},"canonical_sha256":"236c6d5d4f608327cfa7fc3b7b92ff3d3f3550026e8e6c3cc78bcff3c97c5f66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:56.319515Z","signature_b64":"pPWA6VAovPj0h/UCqdb7x5YRgsFEKPMduISj5XkGbZYQTcSGP/Ac5dNwdQLDrDrrJB63xkQh10Kc6quKU8jHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"236c6d5d4f608327cfa7fc3b7b92ff3d3f3550026e8e6c3cc78bcff3c97c5f66","last_reissued_at":"2026-05-20T00:00:56.318662Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:56.318662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15393","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:00:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NxvaCRTTtHFjggKjvfSY97YfZ/Ts2/aQm99TMZ5zScmDzZPCS1no+KHM9netfQPxWGWeQc8eUCdN39Z9sIL5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:47:22.236047Z"},"content_sha256":"40d185545e11bce9facf37d69307618ac4cad0981224aae73ae366302c482fc2","schema_version":"1.0","event_id":"sha256:40d185545e11bce9facf37d69307618ac4cad0981224aae73ae366302c482fc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ENWG2XKPMCBSPT5H7Q5XXEX7HU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LPDS: Evaluating LLM Robustness Through Logic-Preserving Difficulty Scaling","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"Logic-preserving difficulty scaling finds problem variations that cause language models to fail up to five times more often than random tests.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dieuwke Hupkes, Jesse Dodge, Philipp Mondorf, Samuel J. Bell","submitted_at":"2026-05-14T20:26:59Z","abstract_excerpt":"As large language models (LLMs) are increasingly deployed to perform tasks with minimal human oversight, it is crucial that these models operate robustly. In particular, a model that can solve a given problem should not fail simply because certain entities$\\unicode{x2013}$such as names, numbers, or other contextual details$\\unicode{x2013}$have changed while the underlying problem logic remains the same. Prior work suggests that current LLMs still struggle with this form of robustness: they often succeed on some variations of a problem but fail on others. However, existing evaluations often lac"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that LPDS efficiently finds difficult problem variations for a model, resulting in performance drops up to 5 times larger compared to random sampling.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The framework assumes that difficulty of a logic-preserving variation can be quantified in a model-agnostic or at least transferable way that reliably predicts where failures will occur, and that the search procedure finds variations that are truly harder rather than merely different.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"LPDS quantifies difficulty of logic-preserving problem variations and searches for the hardest ones, producing up to 5x larger performance drops than random sampling and better robustness gains from fine-tuning on difficult examples.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Logic-preserving difficulty scaling finds problem variations that cause language models to fail up to five times more often than random tests.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"4868c284b20cd34d47ec39df83f807d8e395912041b769ba1cd18b3fea78ef97"},"source":{"id":"2605.15393","kind":"arxiv","version":1},"verdict":{"id":"f3716853-91ee-4a80-8f50-c16cebf4021b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T16:28:43.234195Z","strongest_claim":"We show that LPDS efficiently finds difficult problem variations for a model, resulting in performance drops up to 5 times larger compared to random sampling.","one_line_summary":"LPDS quantifies difficulty of logic-preserving problem variations and searches for the hardest ones, producing up to 5x larger performance drops than random sampling and better robustness gains from fine-tuning on difficult examples.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The framework assumes that difficulty of a logic-preserving variation can be quantified in a model-agnostic or at least transferable way that reliably predicts where failures will occur, and that the search procedure finds variations that are truly harder rather than merely different.","pith_extraction_headline":"Logic-preserving difficulty scaling finds problem variations that cause language models to fail up to five times more often than random tests."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15393/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T17:01:18.258220Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T16:35:47.406696Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T16:26:23.761732Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T15:50:56.443617Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.167704Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.721310Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"2a6e65153d0868f98a03a80e4de9ddc6b180ac3634a4fd94fe06996ca19c1e01"},"references":{"count":74,"sample":[{"doi":"10.1145/3641289","year":2024,"title":"and Yang, Qiang and Xie, Xing , number =","work_id":"baa1ad58-22ae-43a4-86d6-49b6915c12d6","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3747588","year":2025,"title":"A survey on large language models for code generation","work_id":"2362b076-10d0-4e85-8b67-08ac034b2069","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.18653/v1/2023.acl-long.307","year":2023,"title":"Evaluating Open-Domain Question Answering in the Era of Large Language Models","work_id":"4c6f7651-e3e6-412e-acdc-0cbc939ca956","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Towards Reasoning Era: A Survey of Long Chain-of-Thought for Reasoning Large Language Models","work_id":"0b361fed-cf2a-4b90-b61a-de88de4b8840","ref_index":4,"cited_arxiv_id":"2503.09567","is_internal_anchor":true},{"doi":"10.1038/s41586-025-09422-z","year":null,"title":"Nature645(8081), 633–638 (2025) https://doi.org/10.1038/s41586-025-09422-z","work_id":"9835b482-5032-4135-93dd-82a066677569","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":74,"snapshot_sha256":"8d521af3a732175332d3a8294f64a2f501aa840d73096aa720ca9f7b35373ea0","internal_anchors":12},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b2597318cb21bd8a4d7b69ba05971b9da37bd0e8e8b9f7c0c1e3d77a0a99665b"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"f3716853-91ee-4a80-8f50-c16cebf4021b"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:00:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oC89/OPjWovUX3u7scZv3WtoxTpPKG76Rln+r8IlNCX04gmQaKVBKSozZlFwKblGsf8JlQCYkoHAsGeww6VOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:47:22.237521Z"},"content_sha256":"93661048591bcf35700435d52a9dc4446b887a6aeaa0dd092bc996156d485364","schema_version":"1.0","event_id":"sha256:93661048591bcf35700435d52a9dc4446b887a6aeaa0dd092bc996156d485364"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ENWG2XKPMCBSPT5H7Q5XXEX7HU/bundle.json","state_url":"https://pith.science/pith/ENWG2XKPMCBSPT5H7Q5XXEX7HU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ENWG2XKPMCBSPT5H7Q5XXEX7HU/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-25T23:47:22Z","links":{"resolver":"https://pith.science/pith/ENWG2XKPMCBSPT5H7Q5XXEX7HU","bundle":"https://pith.science/pith/ENWG2XKPMCBSPT5H7Q5XXEX7HU/bundle.json","state":"https://pith.science/pith/ENWG2XKPMCBSPT5H7Q5XXEX7HU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ENWG2XKPMCBSPT5H7Q5XXEX7HU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ENWG2XKPMCBSPT5H7Q5XXEX7HU","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":"1cef0907d0f498f145adbc8860fb3d834bef77895a396b62279f7af2a33f5c26","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T20:26:59Z","title_canon_sha256":"3084e86520bad1b69c41ebd76253a81e4cba3f8551ce75ec8cb122d6bad18f0c"},"schema_version":"1.0","source":{"id":"2605.15393","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15393","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15393v1","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15393","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"pith_short_12","alias_value":"ENWG2XKPMCBS","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"pith_short_16","alias_value":"ENWG2XKPMCBSPT5H","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"pith_short_8","alias_value":"ENWG2XKP","created_at":"2026-05-20T00:00:56Z"}],"graph_snapshots":[{"event_id":"sha256:93661048591bcf35700435d52a9dc4446b887a6aeaa0dd092bc996156d485364","target":"graph","created_at":"2026-05-20T00:00:56Z","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":"We show that LPDS efficiently finds difficult problem variations for a model, resulting in performance drops up to 5 times larger compared to random sampling."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The framework assumes that difficulty of a logic-preserving variation can be quantified in a model-agnostic or at least transferable way that reliably predicts where failures will occur, and that the search procedure finds variations that are truly harder rather than merely different."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"LPDS quantifies difficulty of logic-preserving problem variations and searches for the hardest ones, producing up to 5x larger performance drops than random sampling and better robustness gains from fine-tuning on difficult examples."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Logic-preserving difficulty scaling finds problem variations that cause language models to fail up to five times more often than random tests."}],"snapshot_sha256":"4868c284b20cd34d47ec39df83f807d8e395912041b769ba1cd18b3fea78ef97"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b2597318cb21bd8a4d7b69ba05971b9da37bd0e8e8b9f7c0c1e3d77a0a99665b"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T17:01:18.258220Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T16:35:47.406696Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T16:26:23.761732Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T15:50:56.443617Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.167704Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.721310Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15393/integrity.json","findings":[],"snapshot_sha256":"2a6e65153d0868f98a03a80e4de9ddc6b180ac3634a4fd94fe06996ca19c1e01","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"As large language models (LLMs) are increasingly deployed to perform tasks with minimal human oversight, it is crucial that these models operate robustly. In particular, a model that can solve a given problem should not fail simply because certain entities$\\unicode{x2013}$such as names, numbers, or other contextual details$\\unicode{x2013}$have changed while the underlying problem logic remains the same. Prior work suggests that current LLMs still struggle with this form of robustness: they often succeed on some variations of a problem but fail on others. However, existing evaluations often lac","authors_text":"Dieuwke Hupkes, Jesse Dodge, Philipp Mondorf, Samuel J. Bell","cross_cats":[],"headline":"Logic-preserving difficulty scaling finds problem variations that cause language models to fail up to five times more often than random tests.","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T20:26:59Z","title":"LPDS: Evaluating LLM Robustness Through Logic-Preserving Difficulty Scaling"},"references":{"count":74,"internal_anchors":12,"resolved_work":74,"sample":[{"cited_arxiv_id":"","doi":"10.1145/3641289","is_internal_anchor":false,"ref_index":1,"title":"and Yang, Qiang and Xie, Xing , number =","work_id":"baa1ad58-22ae-43a4-86d6-49b6915c12d6","year":2024},{"cited_arxiv_id":"","doi":"10.1145/3747588","is_internal_anchor":false,"ref_index":2,"title":"A survey on large language models for code generation","work_id":"2362b076-10d0-4e85-8b67-08ac034b2069","year":2025},{"cited_arxiv_id":"","doi":"10.18653/v1/2023.acl-long.307","is_internal_anchor":false,"ref_index":3,"title":"Evaluating Open-Domain Question Answering in the Era of Large Language Models","work_id":"4c6f7651-e3e6-412e-acdc-0cbc939ca956","year":2023},{"cited_arxiv_id":"2503.09567","doi":"","is_internal_anchor":true,"ref_index":4,"title":"Towards Reasoning Era: A Survey of Long Chain-of-Thought for Reasoning Large Language Models","work_id":"0b361fed-cf2a-4b90-b61a-de88de4b8840","year":null},{"cited_arxiv_id":"","doi":"10.1038/s41586-025-09422-z","is_internal_anchor":false,"ref_index":5,"title":"Nature645(8081), 633–638 (2025) https://doi.org/10.1038/s41586-025-09422-z","work_id":"9835b482-5032-4135-93dd-82a066677569","year":null}],"snapshot_sha256":"8d521af3a732175332d3a8294f64a2f501aa840d73096aa720ca9f7b35373ea0"},"source":{"id":"2605.15393","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T16:28:43.234195Z","id":"f3716853-91ee-4a80-8f50-c16cebf4021b","model_set":{"reader":"grok-4.3"},"one_line_summary":"LPDS quantifies difficulty of logic-preserving problem variations and searches for the hardest ones, producing up to 5x larger performance drops than random sampling and better robustness gains from fine-tuning on difficult examples.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Logic-preserving difficulty scaling finds problem variations that cause language models to fail up to five times more often than random tests.","strongest_claim":"We show that LPDS efficiently finds difficult problem variations for a model, resulting in performance drops up to 5 times larger compared to random sampling.","weakest_assumption":"The framework assumes that difficulty of a logic-preserving variation can be quantified in a model-agnostic or at least transferable way that reliably predicts where failures will occur, and that the search procedure finds variations that are truly harder rather than merely different."}},"verdict_id":"f3716853-91ee-4a80-8f50-c16cebf4021b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:40d185545e11bce9facf37d69307618ac4cad0981224aae73ae366302c482fc2","target":"record","created_at":"2026-05-20T00:00:56Z","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":"1cef0907d0f498f145adbc8860fb3d834bef77895a396b62279f7af2a33f5c26","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T20:26:59Z","title_canon_sha256":"3084e86520bad1b69c41ebd76253a81e4cba3f8551ce75ec8cb122d6bad18f0c"},"schema_version":"1.0","source":{"id":"2605.15393","kind":"arxiv","version":1}},"canonical_sha256":"236c6d5d4f608327cfa7fc3b7b92ff3d3f3550026e8e6c3cc78bcff3c97c5f66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"236c6d5d4f608327cfa7fc3b7b92ff3d3f3550026e8e6c3cc78bcff3c97c5f66","first_computed_at":"2026-05-20T00:00:56.318662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:56.318662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pPWA6VAovPj0h/UCqdb7x5YRgsFEKPMduISj5XkGbZYQTcSGP/Ac5dNwdQLDrDrrJB63xkQh10Kc6quKU8jHDQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:56.319515Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15393","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40d185545e11bce9facf37d69307618ac4cad0981224aae73ae366302c482fc2","sha256:93661048591bcf35700435d52a9dc4446b887a6aeaa0dd092bc996156d485364"],"state_sha256":"0256215106a6fa2d2909b5cf58384752afd4670417e4b7035b9a18e3c7a4d06f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qHLg7UYm/dHrsdJIS9LktgDd9sp+V0kkGEd+ABNe0RVCSYYX17x16KbMkzY27gDK3WjtSLzCeQwd6GCzyJ86CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:47:22.242887Z","bundle_sha256":"9f49b2903adcf8d70c1317efccbc97fe6a595b0725e2166dc84c68f2d9817ef2"}}