{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LIBMPMSVHWZ7S2JEAMK33JBK7W","short_pith_number":"pith:LIBMPMSV","canonical_record":{"source":{"id":"2605.17704","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-18T00:00:53Z","cross_cats_sorted":[],"title_canon_sha256":"384a9d1492db2241b97e02283d40c69b245f325342cb96960b2289adac4318f4","abstract_canon_sha256":"2c7c7580093599767840203442bafa64edbea7e5b6d34a4aec80260d4624a973"},"schema_version":"1.0"},"canonical_sha256":"5a02c7b2553db3f969240315bda42afda356f1757290cf1ed95606f081b2849d","source":{"kind":"arxiv","id":"2605.17704","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17704","created_at":"2026-05-20T00:04:53Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17704v1","created_at":"2026-05-20T00:04:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17704","created_at":"2026-05-20T00:04:53Z"},{"alias_kind":"pith_short_12","alias_value":"LIBMPMSVHWZ7","created_at":"2026-05-20T00:04:53Z"},{"alias_kind":"pith_short_16","alias_value":"LIBMPMSVHWZ7S2JE","created_at":"2026-05-20T00:04:53Z"},{"alias_kind":"pith_short_8","alias_value":"LIBMPMSV","created_at":"2026-05-20T00:04:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LIBMPMSVHWZ7S2JEAMK33JBK7W","target":"record","payload":{"canonical_record":{"source":{"id":"2605.17704","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-18T00:00:53Z","cross_cats_sorted":[],"title_canon_sha256":"384a9d1492db2241b97e02283d40c69b245f325342cb96960b2289adac4318f4","abstract_canon_sha256":"2c7c7580093599767840203442bafa64edbea7e5b6d34a4aec80260d4624a973"},"schema_version":"1.0"},"canonical_sha256":"5a02c7b2553db3f969240315bda42afda356f1757290cf1ed95606f081b2849d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:53.654879Z","signature_b64":"nnUbWcqGohWs4HbCxQdlmUJs1gzXpFsG7nmyBsdKXbP5dwFyW8PNBxHQZ/89P6uPD34C5tK0r2aeJ7Y14yvsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a02c7b2553db3f969240315bda42afda356f1757290cf1ed95606f081b2849d","last_reissued_at":"2026-05-20T00:04:53.654081Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:53.654081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.17704","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:04:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uhk7TFS3JTxtfPrF9kT/roYB9Io37uw9/f99Jy7z87nyNHD+cxc5edsZh964FNcbjEhxfr5KFJUiwk3tpL5IAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T02:48:55.986339Z"},"content_sha256":"24e7b002f0956996bd47ab7091ac07a341f0834cf2fa6fbfccbad98137a2a280","schema_version":"1.0","event_id":"sha256:24e7b002f0956996bd47ab7091ac07a341f0834cf2fa6fbfccbad98137a2a280"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LIBMPMSVHWZ7S2JEAMK33JBK7W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Toy Combinatorial Interpretability Models Reveal Lottery Tickets in Early Feature Space","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Winning tickets correspond to precursor locations in feature space already near the final codes at initialization.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alon Bebchuk, Nir Shavit","submitted_at":"2026-05-18T00:00:53Z","abstract_excerpt":"The lottery ticket hypothesis posits that dense networks contain sparse subnetworks, ``winning tickets,'' that, when rewound to their initial weights and retrained in isolation, match the performance of the full model. We ask a more mechanistic question: what internal object does a winning ticket preserve? We work in a combinatorial, clause-structured toy setting that admits an interpretable feature-space representation with well-defined combinatorial distances between features. We show that winning tickets in weight space correspond to precursor locations in feature space that are already nea"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"winning tickets in weight space correspond to precursor locations in feature space that are already near, at initialization, to the final feature-channel codes. A winning ticket is thus a family of compatible code locations that jointly balance proximity to final codes with low inter-feature interference.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The combinatorial, clause-structured toy setting admits an interpretable feature-space representation with well-defined combinatorial distances between features that capture the relevant dynamics of real neural networks under superposition.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"In a combinatorial toy setting, winning lottery tickets preserve families of compatible feature locations in early feature space that balance proximity to final codes with low interference, rather than specific weight subnetworks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Winning tickets correspond to precursor locations in feature space already near the final codes at initialization.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8368c865ca9c63ef62ac228ffba84ec337f60e9ccfe53ba188a3996aaaff97a0"},"source":{"id":"2605.17704","kind":"arxiv","version":1},"verdict":{"id":"ca06049a-8b98-4cf9-91f2-eabf34870def","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T22:06:17.836785Z","strongest_claim":"winning tickets in weight space correspond to precursor locations in feature space that are already near, at initialization, to the final feature-channel codes. A winning ticket is thus a family of compatible code locations that jointly balance proximity to final codes with low inter-feature interference.","one_line_summary":"In a combinatorial toy setting, winning lottery tickets preserve families of compatible feature locations in early feature space that balance proximity to final codes with low interference, rather than specific weight subnetworks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The combinatorial, clause-structured toy setting admits an interpretable feature-space representation with well-defined combinatorial distances between features that capture the relevant dynamics of real neural networks under superposition.","pith_extraction_headline":"Winning tickets correspond to precursor locations in feature space already near the final codes at initialization."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17704/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T22:31:19.405696Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T22:10:57.458735Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"shingle_duplication","ran_at":"2026-05-19T21:49:43.479897Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T21:49:43.309341Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.512988Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T21:21:59.173374Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T21:21:57.420154Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"d12a80bad7596fa66e800253bec3b70f84da1d583d68da6f48c4873a1a360fd1"},"references":{"count":91,"sample":[{"doi":"","year":null,"title":"International Conference on Learning Representations , year=","work_id":"61b9ca7f-3fca-4d6c-8df5-e91576c98a1b","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"International Conference on Learning Representations , year=","work_id":"9145ab82-d376-4eef-ab5b-332886510d7b","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"International Conference on Machine Learning , year=","work_id":"4b9f0050-4324-4b4d-95a0-77ec2030a415","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"International Conference on Learning Representations , year=","work_id":"a8140a03-8d67-4bf8-93d3-896dbb7b2dbe","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Advances in Neural Information Processing Systems , year=","work_id":"9ac2d762-b569-4d13-9f39-17080231cf34","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":91,"snapshot_sha256":"049f8f95a42883fe34c333d33c3083246569f043978576b244084ad54264fa8f","internal_anchors":6},"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":"ca06049a-8b98-4cf9-91f2-eabf34870def"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:04:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9LWc5/JNsWcsHTZP6QPF468bTssSKndRWfwLfPQL2aLQohBb7JS8Rxx2Uow6uEpEgf4smk7DWNrQ3uaI9YWgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T02:48:55.987649Z"},"content_sha256":"e471a58cfdf2f3ce97f58a45949c78af470c420fabd4edbf83a4d2625bfa9376","schema_version":"1.0","event_id":"sha256:e471a58cfdf2f3ce97f58a45949c78af470c420fabd4edbf83a4d2625bfa9376"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LIBMPMSVHWZ7S2JEAMK33JBK7W/bundle.json","state_url":"https://pith.science/pith/LIBMPMSVHWZ7S2JEAMK33JBK7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LIBMPMSVHWZ7S2JEAMK33JBK7W/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-22T02:48:55Z","links":{"resolver":"https://pith.science/pith/LIBMPMSVHWZ7S2JEAMK33JBK7W","bundle":"https://pith.science/pith/LIBMPMSVHWZ7S2JEAMK33JBK7W/bundle.json","state":"https://pith.science/pith/LIBMPMSVHWZ7S2JEAMK33JBK7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LIBMPMSVHWZ7S2JEAMK33JBK7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LIBMPMSVHWZ7S2JEAMK33JBK7W","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":"2c7c7580093599767840203442bafa64edbea7e5b6d34a4aec80260d4624a973","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-18T00:00:53Z","title_canon_sha256":"384a9d1492db2241b97e02283d40c69b245f325342cb96960b2289adac4318f4"},"schema_version":"1.0","source":{"id":"2605.17704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17704","created_at":"2026-05-20T00:04:53Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17704v1","created_at":"2026-05-20T00:04:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17704","created_at":"2026-05-20T00:04:53Z"},{"alias_kind":"pith_short_12","alias_value":"LIBMPMSVHWZ7","created_at":"2026-05-20T00:04:53Z"},{"alias_kind":"pith_short_16","alias_value":"LIBMPMSVHWZ7S2JE","created_at":"2026-05-20T00:04:53Z"},{"alias_kind":"pith_short_8","alias_value":"LIBMPMSV","created_at":"2026-05-20T00:04:53Z"}],"graph_snapshots":[{"event_id":"sha256:e471a58cfdf2f3ce97f58a45949c78af470c420fabd4edbf83a4d2625bfa9376","target":"graph","created_at":"2026-05-20T00:04:53Z","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":"winning tickets in weight space correspond to precursor locations in feature space that are already near, at initialization, to the final feature-channel codes. A winning ticket is thus a family of compatible code locations that jointly balance proximity to final codes with low inter-feature interference."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The combinatorial, clause-structured toy setting admits an interpretable feature-space representation with well-defined combinatorial distances between features that capture the relevant dynamics of real neural networks under superposition."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"In a combinatorial toy setting, winning lottery tickets preserve families of compatible feature locations in early feature space that balance proximity to final codes with low interference, rather than specific weight subnetworks."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Winning tickets correspond to precursor locations in feature space already near the final codes at initialization."}],"snapshot_sha256":"8368c865ca9c63ef62ac228ffba84ec337f60e9ccfe53ba188a3996aaaff97a0"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T22:31:19.405696Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T22:10:57.458735Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"shingle_duplication","ran_at":"2026-05-19T21:49:43.479897Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T21:49:43.309341Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.512988Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T21:21:59.173374Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T21:21:57.420154Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.17704/integrity.json","findings":[],"snapshot_sha256":"d12a80bad7596fa66e800253bec3b70f84da1d583d68da6f48c4873a1a360fd1","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The lottery ticket hypothesis posits that dense networks contain sparse subnetworks, ``winning tickets,'' that, when rewound to their initial weights and retrained in isolation, match the performance of the full model. We ask a more mechanistic question: what internal object does a winning ticket preserve? We work in a combinatorial, clause-structured toy setting that admits an interpretable feature-space representation with well-defined combinatorial distances between features. We show that winning tickets in weight space correspond to precursor locations in feature space that are already nea","authors_text":"Alon Bebchuk, Nir Shavit","cross_cats":[],"headline":"Winning tickets correspond to precursor locations in feature space already near the final codes at initialization.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-18T00:00:53Z","title":"Toy Combinatorial Interpretability Models Reveal Lottery Tickets in Early Feature Space"},"references":{"count":91,"internal_anchors":6,"resolved_work":91,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"International Conference on Learning Representations , year=","work_id":"61b9ca7f-3fca-4d6c-8df5-e91576c98a1b","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"International Conference on Learning Representations , year=","work_id":"9145ab82-d376-4eef-ab5b-332886510d7b","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"International Conference on Machine Learning , year=","work_id":"4b9f0050-4324-4b4d-95a0-77ec2030a415","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"International Conference on Learning Representations , year=","work_id":"a8140a03-8d67-4bf8-93d3-896dbb7b2dbe","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Advances in Neural Information Processing Systems , year=","work_id":"9ac2d762-b569-4d13-9f39-17080231cf34","year":null}],"snapshot_sha256":"049f8f95a42883fe34c333d33c3083246569f043978576b244084ad54264fa8f"},"source":{"id":"2605.17704","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T22:06:17.836785Z","id":"ca06049a-8b98-4cf9-91f2-eabf34870def","model_set":{"reader":"grok-4.3"},"one_line_summary":"In a combinatorial toy setting, winning lottery tickets preserve families of compatible feature locations in early feature space that balance proximity to final codes with low interference, rather than specific weight subnetworks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Winning tickets correspond to precursor locations in feature space already near the final codes at initialization.","strongest_claim":"winning tickets in weight space correspond to precursor locations in feature space that are already near, at initialization, to the final feature-channel codes. A winning ticket is thus a family of compatible code locations that jointly balance proximity to final codes with low inter-feature interference.","weakest_assumption":"The combinatorial, clause-structured toy setting admits an interpretable feature-space representation with well-defined combinatorial distances between features that capture the relevant dynamics of real neural networks under superposition."}},"verdict_id":"ca06049a-8b98-4cf9-91f2-eabf34870def"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:24e7b002f0956996bd47ab7091ac07a341f0834cf2fa6fbfccbad98137a2a280","target":"record","created_at":"2026-05-20T00:04:53Z","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":"2c7c7580093599767840203442bafa64edbea7e5b6d34a4aec80260d4624a973","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-18T00:00:53Z","title_canon_sha256":"384a9d1492db2241b97e02283d40c69b245f325342cb96960b2289adac4318f4"},"schema_version":"1.0","source":{"id":"2605.17704","kind":"arxiv","version":1}},"canonical_sha256":"5a02c7b2553db3f969240315bda42afda356f1757290cf1ed95606f081b2849d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a02c7b2553db3f969240315bda42afda356f1757290cf1ed95606f081b2849d","first_computed_at":"2026-05-20T00:04:53.654081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:53.654081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nnUbWcqGohWs4HbCxQdlmUJs1gzXpFsG7nmyBsdKXbP5dwFyW8PNBxHQZ/89P6uPD34C5tK0r2aeJ7Y14yvsDQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:53.654879Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24e7b002f0956996bd47ab7091ac07a341f0834cf2fa6fbfccbad98137a2a280","sha256:e471a58cfdf2f3ce97f58a45949c78af470c420fabd4edbf83a4d2625bfa9376"],"state_sha256":"b9513b84a7d9cbf0f918d91959e85018f352bdffeac563ab67760de5030f2365"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C6z7ZjpCAqPOa3dk+9KHPXQTC4+b4xTWP1gPwM8SlPgdi07hcEVrIwY6vUtmiRSsc+cv0x/TJ1wgIBrqrbdVCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T02:48:55.992973Z","bundle_sha256":"b0112c6c104b5e00cbdfa0cf3844c790d495397003db9ac246a677c306235be0"}}