{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:OE3BD6IUOFUDME4D6X4GF7Y3XI","short_pith_number":"pith:OE3BD6IU","canonical_record":{"source":{"id":"2605.15856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2026-05-15T11:14:55Z","cross_cats_sorted":[],"title_canon_sha256":"ef6b457f1509f259716dd98a2fedfc400d203fa9d93b087bf80252c96b310670","abstract_canon_sha256":"e7928e7de4ac86834cdb4cea464111014de9704c5fc55b941bbeb9b3bab16d58"},"schema_version":"1.0"},"canonical_sha256":"713611f9147168361383f5f862ff1bba279c7635b34a4e8e0a0c87bad09f2ea5","source":{"kind":"arxiv","id":"2605.15856","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15856","created_at":"2026-05-20T00:01:22Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15856v1","created_at":"2026-05-20T00:01:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15856","created_at":"2026-05-20T00:01:22Z"},{"alias_kind":"pith_short_12","alias_value":"OE3BD6IUOFUD","created_at":"2026-05-20T00:01:22Z"},{"alias_kind":"pith_short_16","alias_value":"OE3BD6IUOFUDME4D","created_at":"2026-05-20T00:01:22Z"},{"alias_kind":"pith_short_8","alias_value":"OE3BD6IU","created_at":"2026-05-20T00:01:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:OE3BD6IUOFUDME4D6X4GF7Y3XI","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2026-05-15T11:14:55Z","cross_cats_sorted":[],"title_canon_sha256":"ef6b457f1509f259716dd98a2fedfc400d203fa9d93b087bf80252c96b310670","abstract_canon_sha256":"e7928e7de4ac86834cdb4cea464111014de9704c5fc55b941bbeb9b3bab16d58"},"schema_version":"1.0"},"canonical_sha256":"713611f9147168361383f5f862ff1bba279c7635b34a4e8e0a0c87bad09f2ea5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:22.188041Z","signature_b64":"OU5U9+n7EIcMeXF6UtVWHe/QWj9RVwT7sBkSmUe+TxN6W+1/x9AJrcvCbfcDKW80vqqRGMqJuXiieb/tCUZ8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"713611f9147168361383f5f862ff1bba279c7635b34a4e8e0a0c87bad09f2ea5","last_reissued_at":"2026-05-20T00:01:22.187183Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:22.187183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15856","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:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UH8N/Gc0/Y2jxDcYK5z6KMjmkw+AT7Dnnikyyp5ETpveshQ0VesjFcbac1nCg68VbX/xvsU9XmKiQC85/txaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T01:46:16.863998Z"},"content_sha256":"c469735b1e1af21cc20bab56173e4d05d621fe3acfca4809283a10dec8066e62","schema_version":"1.0","event_id":"sha256:c469735b1e1af21cc20bab56173e4d05d621fe3acfca4809283a10dec8066e62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:OE3BD6IUOFUDME4D6X4GF7Y3XI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"crossfit: A Graph-Based Cross-Fitting Engine in R","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The crossfit R package provides a general-purpose cross-fitting engine using user-specified DAGs of nuisance models with custom fold allocations.","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Etienne Peyrot, Fran\\c{c}ois Petit","submitted_at":"2026-05-15T11:14:55Z","abstract_excerpt":"Cross-fitting is a key ingredient in many semiparametric estimation procedures, such as double/debiased machine learning (DML), enabling valid estimation of low-dimensional targets in the presence of high-dimensional nuisance functions by enforcing out-of-sample use of nuisance predictions. crossfit is an R package that provides a general-purpose, estimator-agnostic cross-fitting engine. Users specify (i) a target functional and (ii) a directed acyclic graph (DAG) of nuisance models, with node-specific training fold widths and target-specific evaluation windows. The engine executes a reproduci"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"crossfit is an R package that provides a general-purpose, estimator-agnostic cross-fitting engine. Users specify (i) a target functional and (ii) a directed acyclic graph (DAG) of nuisance models, with node-specific training fold widths and target-specific evaluation windows.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The package's internal scheduler and caching logic correctly execute the user-specified DAG and fold-allocation rules without introducing unintended data leakage or dependence between nuisance branches, as stated in the description of disjoint and independence-enforcing modes.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"crossfit is an R package that supplies a general-purpose cross-fitting engine driven by user-specified DAGs of nuisance models with configurable fold allocations and reproducibility features.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The crossfit R package provides a general-purpose cross-fitting engine using user-specified DAGs of nuisance models with custom fold allocations.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c304fec5a643e53050b0bdf1ec2e782b72c891685f913ac54be714a7ce525bd1"},"source":{"id":"2605.15856","kind":"arxiv","version":1},"verdict":{"id":"fa9a1620-11ba-46b8-ad00-3dcee3c132ed","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T18:03:16.118805Z","strongest_claim":"crossfit is an R package that provides a general-purpose, estimator-agnostic cross-fitting engine. Users specify (i) a target functional and (ii) a directed acyclic graph (DAG) of nuisance models, with node-specific training fold widths and target-specific evaluation windows.","one_line_summary":"crossfit is an R package that supplies a general-purpose cross-fitting engine driven by user-specified DAGs of nuisance models with configurable fold allocations and reproducibility features.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The package's internal scheduler and caching logic correctly execute the user-specified DAG and fold-allocation rules without introducing unintended data leakage or dependence between nuisance branches, as stated in the description of disjoint and independence-enforcing modes.","pith_extraction_headline":"The crossfit R package provides a general-purpose cross-fitting engine using user-specified DAGs of nuisance models with custom fold allocations."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15856/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T18:31:18.773741Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T18:10:15.757060Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:48.703845Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:01:55.823110Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"53e50145ab7ff487023ce04a3d13a37cd2c094d7c660088fdb244f374ae541b9"},"references":{"count":15,"sample":[{"doi":"10.1214/aos/","year":1982,"title":"doi: 10.1214/aos/ 1176342360","work_id":"5bd55533-e64d-4884-b62b-14c429566078","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1214/aos/1176350055","year":1986,"title":"On Asymptotically Efficient Estimation in Semiparametric Models","work_id":"dec623fd-0fa8-4c67-bc86-16b9e1bc5fd2","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2011,"title":"Cross-Validated Targeted Minimum- Loss-Based Estimation","work_id":"90899aad-2f56-41ca-a394-455d3d3ebae3","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"arXiv preprint arXiv:1801.09138 , year=","work_id":"2a799d79-cace-45bb-98a8-de5ca7ea05f3","ref_index":4,"cited_arxiv_id":"1801.09138","is_internal_anchor":true},{"doi":"10.1111/ectj.12097","year":2018,"title":"Double/debiased machine learning for treatment and structural parameters.The Econometrics Journal, 21(1):C1–C68","work_id":"f1c0cebd-ff53-46ac-aa98-210211b3f171","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":15,"snapshot_sha256":"bbc0bf62988443cf2ed9f038af09d84a144abdcfea75d5ba5eecd318524a7163","internal_anchors":1},"formal_canon":{"evidence_count":1,"snapshot_sha256":"e73a6c647392ac05f4e8ba0795dd1dcc423d488ec9ac93b06ae50c549a15ac92"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"fa9a1620-11ba-46b8-ad00-3dcee3c132ed"},"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:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kHH68h3M6KqGlxTRYj5vrtOQfrDOLKrQfdCmk21dEcWPRcXY6hzZr8oU2CH1O8iCHWrcjKE1abjEU5JlqC4bCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T01:46:16.865237Z"},"content_sha256":"e2dec4d5b9ba34d230967f114e6a3dd2488e8bdb51cb42d12d3c9ff3f86c6022","schema_version":"1.0","event_id":"sha256:e2dec4d5b9ba34d230967f114e6a3dd2488e8bdb51cb42d12d3c9ff3f86c6022"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OE3BD6IUOFUDME4D6X4GF7Y3XI/bundle.json","state_url":"https://pith.science/pith/OE3BD6IUOFUDME4D6X4GF7Y3XI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OE3BD6IUOFUDME4D6X4GF7Y3XI/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-22T01:46:16Z","links":{"resolver":"https://pith.science/pith/OE3BD6IUOFUDME4D6X4GF7Y3XI","bundle":"https://pith.science/pith/OE3BD6IUOFUDME4D6X4GF7Y3XI/bundle.json","state":"https://pith.science/pith/OE3BD6IUOFUDME4D6X4GF7Y3XI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OE3BD6IUOFUDME4D6X4GF7Y3XI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OE3BD6IUOFUDME4D6X4GF7Y3XI","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":"e7928e7de4ac86834cdb4cea464111014de9704c5fc55b941bbeb9b3bab16d58","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2026-05-15T11:14:55Z","title_canon_sha256":"ef6b457f1509f259716dd98a2fedfc400d203fa9d93b087bf80252c96b310670"},"schema_version":"1.0","source":{"id":"2605.15856","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15856","created_at":"2026-05-20T00:01:22Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15856v1","created_at":"2026-05-20T00:01:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15856","created_at":"2026-05-20T00:01:22Z"},{"alias_kind":"pith_short_12","alias_value":"OE3BD6IUOFUD","created_at":"2026-05-20T00:01:22Z"},{"alias_kind":"pith_short_16","alias_value":"OE3BD6IUOFUDME4D","created_at":"2026-05-20T00:01:22Z"},{"alias_kind":"pith_short_8","alias_value":"OE3BD6IU","created_at":"2026-05-20T00:01:22Z"}],"graph_snapshots":[{"event_id":"sha256:e2dec4d5b9ba34d230967f114e6a3dd2488e8bdb51cb42d12d3c9ff3f86c6022","target":"graph","created_at":"2026-05-20T00:01:22Z","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":"crossfit is an R package that provides a general-purpose, estimator-agnostic cross-fitting engine. Users specify (i) a target functional and (ii) a directed acyclic graph (DAG) of nuisance models, with node-specific training fold widths and target-specific evaluation windows."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The package's internal scheduler and caching logic correctly execute the user-specified DAG and fold-allocation rules without introducing unintended data leakage or dependence between nuisance branches, as stated in the description of disjoint and independence-enforcing modes."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"crossfit is an R package that supplies a general-purpose cross-fitting engine driven by user-specified DAGs of nuisance models with configurable fold allocations and reproducibility features."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The crossfit R package provides a general-purpose cross-fitting engine using user-specified DAGs of nuisance models with custom fold allocations."}],"snapshot_sha256":"c304fec5a643e53050b0bdf1ec2e782b72c891685f913ac54be714a7ce525bd1"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"e73a6c647392ac05f4e8ba0795dd1dcc423d488ec9ac93b06ae50c549a15ac92"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T18:31:18.773741Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T18:10:15.757060Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:48.703845Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T17:01:55.823110Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.15856/integrity.json","findings":[],"snapshot_sha256":"53e50145ab7ff487023ce04a3d13a37cd2c094d7c660088fdb244f374ae541b9","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Cross-fitting is a key ingredient in many semiparametric estimation procedures, such as double/debiased machine learning (DML), enabling valid estimation of low-dimensional targets in the presence of high-dimensional nuisance functions by enforcing out-of-sample use of nuisance predictions. crossfit is an R package that provides a general-purpose, estimator-agnostic cross-fitting engine. Users specify (i) a target functional and (ii) a directed acyclic graph (DAG) of nuisance models, with node-specific training fold widths and target-specific evaluation windows. The engine executes a reproduci","authors_text":"Etienne Peyrot, Fran\\c{c}ois Petit","cross_cats":[],"headline":"The crossfit R package provides a general-purpose cross-fitting engine using user-specified DAGs of nuisance models with custom fold allocations.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2026-05-15T11:14:55Z","title":"crossfit: A Graph-Based Cross-Fitting Engine in R"},"references":{"count":15,"internal_anchors":1,"resolved_work":15,"sample":[{"cited_arxiv_id":"","doi":"10.1214/aos/","is_internal_anchor":false,"ref_index":1,"title":"doi: 10.1214/aos/ 1176342360","work_id":"5bd55533-e64d-4884-b62b-14c429566078","year":1982},{"cited_arxiv_id":"","doi":"10.1214/aos/1176350055","is_internal_anchor":false,"ref_index":2,"title":"On Asymptotically Efficient Estimation in Semiparametric Models","work_id":"dec623fd-0fa8-4c67-bc86-16b9e1bc5fd2","year":1986},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Cross-Validated Targeted Minimum- Loss-Based Estimation","work_id":"90899aad-2f56-41ca-a394-455d3d3ebae3","year":2011},{"cited_arxiv_id":"1801.09138","doi":"","is_internal_anchor":true,"ref_index":4,"title":"arXiv preprint arXiv:1801.09138 , year=","work_id":"2a799d79-cace-45bb-98a8-de5ca7ea05f3","year":2018},{"cited_arxiv_id":"","doi":"10.1111/ectj.12097","is_internal_anchor":false,"ref_index":5,"title":"Double/debiased machine learning for treatment and structural parameters.The Econometrics Journal, 21(1):C1–C68","work_id":"f1c0cebd-ff53-46ac-aa98-210211b3f171","year":2018}],"snapshot_sha256":"bbc0bf62988443cf2ed9f038af09d84a144abdcfea75d5ba5eecd318524a7163"},"source":{"id":"2605.15856","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T18:03:16.118805Z","id":"fa9a1620-11ba-46b8-ad00-3dcee3c132ed","model_set":{"reader":"grok-4.3"},"one_line_summary":"crossfit is an R package that supplies a general-purpose cross-fitting engine driven by user-specified DAGs of nuisance models with configurable fold allocations and reproducibility features.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The crossfit R package provides a general-purpose cross-fitting engine using user-specified DAGs of nuisance models with custom fold allocations.","strongest_claim":"crossfit is an R package that provides a general-purpose, estimator-agnostic cross-fitting engine. Users specify (i) a target functional and (ii) a directed acyclic graph (DAG) of nuisance models, with node-specific training fold widths and target-specific evaluation windows.","weakest_assumption":"The package's internal scheduler and caching logic correctly execute the user-specified DAG and fold-allocation rules without introducing unintended data leakage or dependence between nuisance branches, as stated in the description of disjoint and independence-enforcing modes."}},"verdict_id":"fa9a1620-11ba-46b8-ad00-3dcee3c132ed"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c469735b1e1af21cc20bab56173e4d05d621fe3acfca4809283a10dec8066e62","target":"record","created_at":"2026-05-20T00:01:22Z","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":"e7928e7de4ac86834cdb4cea464111014de9704c5fc55b941bbeb9b3bab16d58","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2026-05-15T11:14:55Z","title_canon_sha256":"ef6b457f1509f259716dd98a2fedfc400d203fa9d93b087bf80252c96b310670"},"schema_version":"1.0","source":{"id":"2605.15856","kind":"arxiv","version":1}},"canonical_sha256":"713611f9147168361383f5f862ff1bba279c7635b34a4e8e0a0c87bad09f2ea5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"713611f9147168361383f5f862ff1bba279c7635b34a4e8e0a0c87bad09f2ea5","first_computed_at":"2026-05-20T00:01:22.187183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:22.187183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OU5U9+n7EIcMeXF6UtVWHe/QWj9RVwT7sBkSmUe+TxN6W+1/x9AJrcvCbfcDKW80vqqRGMqJuXiieb/tCUZ8Bg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:22.188041Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15856","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c469735b1e1af21cc20bab56173e4d05d621fe3acfca4809283a10dec8066e62","sha256:e2dec4d5b9ba34d230967f114e6a3dd2488e8bdb51cb42d12d3c9ff3f86c6022"],"state_sha256":"530c060edd1ac65de153765e199d4d07923bcae0b010ab4a06251213bbf44531"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lZyMgLsJHNzRmZoydpjBxjt5zV+SHvIJ3n1xp8zMNIr7JhP8DL3ksKDKFppKaZsygu46CLM6QtcChDBfoWWWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T01:46:16.870671Z","bundle_sha256":"7d250356d22a9217a36a828989aef2827847fa6b3814dbea6d0a64007ee484c9"}}