{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ERUBIIKC47NIQXK2ONAXU4OITB","short_pith_number":"pith:ERUBIIKC","canonical_record":{"source":{"id":"2605.16758","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-16T02:13:32Z","cross_cats_sorted":[],"title_canon_sha256":"c24045332153d795b33835574fedd17752258a19b44f53d7c0905091e6fbe890","abstract_canon_sha256":"81e391107dbb63958655a5e6b6c50d0f39629bf2c848790de10e7cf2d2fde2ff"},"schema_version":"1.0"},"canonical_sha256":"2468142142e7da885d5a73417a71c8986260f8de53dc22d3a36340d384292122","source":{"kind":"arxiv","id":"2605.16758","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16758","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16758v1","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16758","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"ERUBIIKC47NI","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"pith_short_16","alias_value":"ERUBIIKC47NIQXK2","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"pith_short_8","alias_value":"ERUBIIKC","created_at":"2026-05-20T00:03:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ERUBIIKC47NIQXK2ONAXU4OITB","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16758","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-16T02:13:32Z","cross_cats_sorted":[],"title_canon_sha256":"c24045332153d795b33835574fedd17752258a19b44f53d7c0905091e6fbe890","abstract_canon_sha256":"81e391107dbb63958655a5e6b6c50d0f39629bf2c848790de10e7cf2d2fde2ff"},"schema_version":"1.0"},"canonical_sha256":"2468142142e7da885d5a73417a71c8986260f8de53dc22d3a36340d384292122","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:20.251959Z","signature_b64":"mJFrfh9sTQXEnbPFeDE8TqaEuZ5CCFBgEpRgCDfbFDKe8Cwc/Ao6x6YX8U6b13VzeFYKzR8Rw+o3rMPOtCJTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2468142142e7da885d5a73417a71c8986260f8de53dc22d3a36340d384292122","last_reissued_at":"2026-05-20T00:03:20.251045Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:20.251045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16758","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:03:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"giMgRK6TdpTV886jj2c4G0M9KYPA4rMRjUWrAZORiR34uSSntoMBblgFlrjtXFJniePGtPtzEhpDVuo2TQwwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T17:29:45.573058Z"},"content_sha256":"788107c290ba2f6277d607a88036d6bc44b07aefbedb1bed04ba571a9dbf5318","schema_version":"1.0","event_id":"sha256:788107c290ba2f6277d607a88036d6bc44b07aefbedb1bed04ba571a9dbf5318"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ERUBIIKC47NIQXK2ONAXU4OITB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Language Acquisition Device in Large Language Models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"Pre-pretraining LLMs on MP-STRUCT achieves token efficiency on par with strong baselines while adding resistance to implausible languages.","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Masato Mita, Ryo Yoshida, Taiga Someya, Yohei Oseki","submitted_at":"2026-05-16T02:13:32Z","abstract_excerpt":"Large Language Models (LLMs) remain substantially less data-efficient than humans. Pre-pretraining (PPT) on synthetic languages has been proposed to close this gap, with prior work emphasizing highly expressive formal languages such as $k$-Shuffle Dyck. Inspired by the Language Acquisition Device (LAD) hypothesis, which posits that innate constraints preemptively restrict the learner's hypothesis space to natural-language-like structure, we propose LAD-inspired PPT: pre-pretraining on MP-STRUCT, a formal language whose strings encode hierarchical composition, feature-based dependencies, and lo"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"A brief 500-step PPT with MP-STRUCT matches strong formal-language baselines in token efficiency while additionally imparting a human-like resistance to structurally implausible languages (e.g., REVERSE).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the structural properties encoded in MP-STRUCT (hierarchical composition, feature-based dependencies, long-distance displacement) successfully instantiate the innate constraints of the LAD hypothesis and transfer to improved natural-language behavior in LLMs.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Pre-pretraining on MP-STRUCT matches k-Shuffle Dyck baselines in efficiency while adding human-like resistance to implausible languages and challenges the need for C-RASP definability in effective PPT languages.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Pre-pretraining LLMs on MP-STRUCT achieves token efficiency on par with strong baselines while adding resistance to implausible languages.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"bb954bf25e6c819612c47d71ed52ee6a6cd38206696eadec10a1a93bb711bc7d"},"source":{"id":"2605.16758","kind":"arxiv","version":1},"verdict":{"id":"4f9f21e2-b5f9-4540-9feb-a7053aff5f25","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T21:41:19.236203Z","strongest_claim":"A brief 500-step PPT with MP-STRUCT matches strong formal-language baselines in token efficiency while additionally imparting a human-like resistance to structurally implausible languages (e.g., REVERSE).","one_line_summary":"Pre-pretraining on MP-STRUCT matches k-Shuffle Dyck baselines in efficiency while adding human-like resistance to implausible languages and challenges the need for C-RASP definability in effective PPT languages.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the structural properties encoded in MP-STRUCT (hierarchical composition, feature-based dependencies, long-distance displacement) successfully instantiate the innate constraints of the LAD hypothesis and transfer to improved natural-language behavior in LLMs.","pith_extraction_headline":"Pre-pretraining LLMs on MP-STRUCT achieves token efficiency on par with strong baselines while adding resistance to implausible languages."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16758/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:19.776145Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:51:05.042862Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.321161Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.452872Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"c59784603001e5845ad14611bfd48d19b12910ad2786b2f33677060487c7f6d0"},"references":{"count":109,"sample":[{"doi":"10.1016/s0019-9958(59)90362-6","year":1959,"title":"Noam Chomsky , abstract =. On. Information and Control , volume =. 1959 , issn =. doi:https://doi.org/10.1016/S0019-9958(59)90362-6 , url =","work_id":"5d90bc7c-5e77-4fbe-a770-f25d6119e962","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1995,"title":"The Minimalist Program , author=. 1995 , publisher=","work_id":"246c6af0-a6e3-4ff7-afd7-75e56f224263","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Step by Step: Essays on Minimalist Syntax in Honor of Howard Lasnik , editor =","work_id":"339aae2a-f40d-47a2-a74c-35d7d4d26778","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.7551/mitpress/4056.003.0004","year":2001,"title":"Derivation by Phase , ISBN =","work_id":"059d5566-ad07-44b3-87f8-bf696a54671e","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1093/oso/9780195171976.003.0004","year":2004,"title":"Marks, Handbook of Fourier analysis & its ap- plications","work_id":"fcfa379d-a0c1-4bdd-ba3c-f51f71c1fa13","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":109,"snapshot_sha256":"098aa21569c78c3aa04b85288d17e5d16a878ac559f8ad5d722411920f6650e3","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8c28ff46ac2d597a3fbef7d5098e18a37e437099e1bac60ade54689c1025f930"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"4f9f21e2-b5f9-4540-9feb-a7053aff5f25"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PtctLlWtvLP+P6M5Cv6tsg/WDfMyPx8WEUw9pWtTtSzIywGBohaf4b/Zip5vUgsCnq7swFlcIoDIjQRb9PQGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T17:29:45.573802Z"},"content_sha256":"9eb91ddc23b778f4a3846b1e4f91d3ade8e526ff24d0dfd96885fe1af4a53f22","schema_version":"1.0","event_id":"sha256:9eb91ddc23b778f4a3846b1e4f91d3ade8e526ff24d0dfd96885fe1af4a53f22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ERUBIIKC47NIQXK2ONAXU4OITB/bundle.json","state_url":"https://pith.science/pith/ERUBIIKC47NIQXK2ONAXU4OITB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ERUBIIKC47NIQXK2ONAXU4OITB/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-23T17:29:45Z","links":{"resolver":"https://pith.science/pith/ERUBIIKC47NIQXK2ONAXU4OITB","bundle":"https://pith.science/pith/ERUBIIKC47NIQXK2ONAXU4OITB/bundle.json","state":"https://pith.science/pith/ERUBIIKC47NIQXK2ONAXU4OITB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ERUBIIKC47NIQXK2ONAXU4OITB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ERUBIIKC47NIQXK2ONAXU4OITB","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":"81e391107dbb63958655a5e6b6c50d0f39629bf2c848790de10e7cf2d2fde2ff","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-16T02:13:32Z","title_canon_sha256":"c24045332153d795b33835574fedd17752258a19b44f53d7c0905091e6fbe890"},"schema_version":"1.0","source":{"id":"2605.16758","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16758","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16758v1","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16758","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"ERUBIIKC47NI","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"pith_short_16","alias_value":"ERUBIIKC47NIQXK2","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"pith_short_8","alias_value":"ERUBIIKC","created_at":"2026-05-20T00:03:20Z"}],"graph_snapshots":[{"event_id":"sha256:9eb91ddc23b778f4a3846b1e4f91d3ade8e526ff24d0dfd96885fe1af4a53f22","target":"graph","created_at":"2026-05-20T00:03:20Z","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":"A brief 500-step PPT with MP-STRUCT matches strong formal-language baselines in token efficiency while additionally imparting a human-like resistance to structurally implausible languages (e.g., REVERSE)."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the structural properties encoded in MP-STRUCT (hierarchical composition, feature-based dependencies, long-distance displacement) successfully instantiate the innate constraints of the LAD hypothesis and transfer to improved natural-language behavior in LLMs."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Pre-pretraining on MP-STRUCT matches k-Shuffle Dyck baselines in efficiency while adding human-like resistance to implausible languages and challenges the need for C-RASP definability in effective PPT languages."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Pre-pretraining LLMs on MP-STRUCT achieves token efficiency on par with strong baselines while adding resistance to implausible languages."}],"snapshot_sha256":"bb954bf25e6c819612c47d71ed52ee6a6cd38206696eadec10a1a93bb711bc7d"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8c28ff46ac2d597a3fbef7d5098e18a37e437099e1bac60ade54689c1025f930"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:19.776145Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:51:05.042862Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.321161Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.452872Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16758/integrity.json","findings":[],"snapshot_sha256":"c59784603001e5845ad14611bfd48d19b12910ad2786b2f33677060487c7f6d0","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large Language Models (LLMs) remain substantially less data-efficient than humans. Pre-pretraining (PPT) on synthetic languages has been proposed to close this gap, with prior work emphasizing highly expressive formal languages such as $k$-Shuffle Dyck. Inspired by the Language Acquisition Device (LAD) hypothesis, which posits that innate constraints preemptively restrict the learner's hypothesis space to natural-language-like structure, we propose LAD-inspired PPT: pre-pretraining on MP-STRUCT, a formal language whose strings encode hierarchical composition, feature-based dependencies, and lo","authors_text":"Masato Mita, Ryo Yoshida, Taiga Someya, Yohei Oseki","cross_cats":[],"headline":"Pre-pretraining LLMs on MP-STRUCT achieves token efficiency on par with strong baselines while adding resistance to implausible languages.","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-16T02:13:32Z","title":"Language Acquisition Device in Large Language Models"},"references":{"count":109,"internal_anchors":0,"resolved_work":109,"sample":[{"cited_arxiv_id":"","doi":"10.1016/s0019-9958(59)90362-6","is_internal_anchor":false,"ref_index":1,"title":"Noam Chomsky , abstract =. On. Information and Control , volume =. 1959 , issn =. doi:https://doi.org/10.1016/S0019-9958(59)90362-6 , url =","work_id":"5d90bc7c-5e77-4fbe-a770-f25d6119e962","year":1959},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"The Minimalist Program , author=. 1995 , publisher=","work_id":"246c6af0-a6e3-4ff7-afd7-75e56f224263","year":1995},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Step by Step: Essays on Minimalist Syntax in Honor of Howard Lasnik , editor =","work_id":"339aae2a-f40d-47a2-a74c-35d7d4d26778","year":null},{"cited_arxiv_id":"","doi":"10.7551/mitpress/4056.003.0004","is_internal_anchor":false,"ref_index":4,"title":"Derivation by Phase , ISBN =","work_id":"059d5566-ad07-44b3-87f8-bf696a54671e","year":2001},{"cited_arxiv_id":"","doi":"10.1093/oso/9780195171976.003.0004","is_internal_anchor":false,"ref_index":5,"title":"Marks, Handbook of Fourier analysis & its ap- plications","work_id":"fcfa379d-a0c1-4bdd-ba3c-f51f71c1fa13","year":2004}],"snapshot_sha256":"098aa21569c78c3aa04b85288d17e5d16a878ac559f8ad5d722411920f6650e3"},"source":{"id":"2605.16758","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:41:19.236203Z","id":"4f9f21e2-b5f9-4540-9feb-a7053aff5f25","model_set":{"reader":"grok-4.3"},"one_line_summary":"Pre-pretraining on MP-STRUCT matches k-Shuffle Dyck baselines in efficiency while adding human-like resistance to implausible languages and challenges the need for C-RASP definability in effective PPT languages.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Pre-pretraining LLMs on MP-STRUCT achieves token efficiency on par with strong baselines while adding resistance to implausible languages.","strongest_claim":"A brief 500-step PPT with MP-STRUCT matches strong formal-language baselines in token efficiency while additionally imparting a human-like resistance to structurally implausible languages (e.g., REVERSE).","weakest_assumption":"That the structural properties encoded in MP-STRUCT (hierarchical composition, feature-based dependencies, long-distance displacement) successfully instantiate the innate constraints of the LAD hypothesis and transfer to improved natural-language behavior in LLMs."}},"verdict_id":"4f9f21e2-b5f9-4540-9feb-a7053aff5f25"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:788107c290ba2f6277d607a88036d6bc44b07aefbedb1bed04ba571a9dbf5318","target":"record","created_at":"2026-05-20T00:03:20Z","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":"81e391107dbb63958655a5e6b6c50d0f39629bf2c848790de10e7cf2d2fde2ff","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-16T02:13:32Z","title_canon_sha256":"c24045332153d795b33835574fedd17752258a19b44f53d7c0905091e6fbe890"},"schema_version":"1.0","source":{"id":"2605.16758","kind":"arxiv","version":1}},"canonical_sha256":"2468142142e7da885d5a73417a71c8986260f8de53dc22d3a36340d384292122","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2468142142e7da885d5a73417a71c8986260f8de53dc22d3a36340d384292122","first_computed_at":"2026-05-20T00:03:20.251045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:20.251045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mJFrfh9sTQXEnbPFeDE8TqaEuZ5CCFBgEpRgCDfbFDKe8Cwc/Ao6x6YX8U6b13VzeFYKzR8Rw+o3rMPOtCJTAw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:20.251959Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16758","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:788107c290ba2f6277d607a88036d6bc44b07aefbedb1bed04ba571a9dbf5318","sha256:9eb91ddc23b778f4a3846b1e4f91d3ade8e526ff24d0dfd96885fe1af4a53f22"],"state_sha256":"c0d0d58f5049228891b4f131c5c98ba1d44b0d3991b4ce44634c8d5d0e11292b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lmzS4h7CkcHLE6Sxz9sch3y7JZ1Il8yR0a3ysLO4nOHGIz46KGe9+p/ITXRHmRdhH7b2win9qZgYV9V8kkv0CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T17:29:45.577611Z","bundle_sha256":"967ee3ef7ed6510dde40c7df7f7ffe9c7caeea8c90ebda6f09e1182818bd99da"}}