{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QMR3XZRXDUCFWMFPQ6TKKW2PPB","short_pith_number":"pith:QMR3XZRX","canonical_record":{"source":{"id":"2605.15294","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2026-05-14T18:10:19Z","cross_cats_sorted":[],"title_canon_sha256":"93cf868a6be0cd0139d78001bdaed7e4160d109bdcc85eda2ddaf11d82a56353","abstract_canon_sha256":"3a2f8a217ab24c949beb3a597e8180f43719f1f75c26462d74ca2a67ec31982a"},"schema_version":"1.0"},"canonical_sha256":"8323bbe6371d045b30af87a6a55b4f7845a0b5340d60414bb78cbf99e7a4b36e","source":{"kind":"arxiv","id":"2605.15294","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15294","created_at":"2026-05-20T00:00:51Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15294v1","created_at":"2026-05-20T00:00:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15294","created_at":"2026-05-20T00:00:51Z"},{"alias_kind":"pith_short_12","alias_value":"QMR3XZRXDUCF","created_at":"2026-05-20T00:00:51Z"},{"alias_kind":"pith_short_16","alias_value":"QMR3XZRXDUCFWMFP","created_at":"2026-05-20T00:00:51Z"},{"alias_kind":"pith_short_8","alias_value":"QMR3XZRX","created_at":"2026-05-20T00:00:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QMR3XZRXDUCFWMFPQ6TKKW2PPB","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15294","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2026-05-14T18:10:19Z","cross_cats_sorted":[],"title_canon_sha256":"93cf868a6be0cd0139d78001bdaed7e4160d109bdcc85eda2ddaf11d82a56353","abstract_canon_sha256":"3a2f8a217ab24c949beb3a597e8180f43719f1f75c26462d74ca2a67ec31982a"},"schema_version":"1.0"},"canonical_sha256":"8323bbe6371d045b30af87a6a55b4f7845a0b5340d60414bb78cbf99e7a4b36e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:51.137564Z","signature_b64":"slt2Eq5RHWqXshIEC9dvFk6tWjPTPoDK8TI/GbgW2yJl9YBGgn7Uwa+DcCE0yprSj8R6i8VvuFiK3XE2sMVbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8323bbe6371d045b30af87a6a55b4f7845a0b5340d60414bb78cbf99e7a4b36e","last_reissued_at":"2026-05-20T00:00:51.136782Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:51.136782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15294","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:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p42jJr5mdTUpufyZpG8MXmVIfx1Oepb7aySZr7FDeubf0vQ8GgMJ3P0YM/8DSx8imDtH/J7pbq6pfxbs1NymAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T02:58:06.484713Z"},"content_sha256":"756a1479ddbe5951144b6e83d63862a4e30151727f7057b523b50f5f3a702ba5","schema_version":"1.0","event_id":"sha256:756a1479ddbe5951144b6e83d63862a4e30151727f7057b523b50f5f3a702ba5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QMR3XZRXDUCFWMFPQ6TKKW2PPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An $L^{\\#}$ Based Algorithm for Active Learning of Minimal Separating Automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A simple algorithm based on L# learns minimal DFAs that separate two disjoint languages.","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Frits Vaandrager, Jasper Laumen, Leonne Snel","submitted_at":"2026-05-14T18:10:19Z","abstract_excerpt":"A DFA separates two disjoint languages $L_1$ and $L_2$ if it accepts every word in $L_1$ and rejects every word in $L_2$. Algorithms for active learning of small separating DFAs have many applications, e.g., for learning network invariants, learning contextual assumptions in compositional verification, learning state machines from large amounts of log data, and learning bug pattern descriptions. We propose a simple active learning algorithm, inspired by $L^{\\#}$, that learns a minimal separating DFA for disjoint languages $L_1$ and $L_2$ if one exists. Experiments show that our algorithm signi"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We propose a simple active learning algorithm, inspired by L#, that learns a minimal separating DFA for disjoint languages L1 and L2 if one exists.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The two input languages are disjoint and a finite minimal separating DFA for them exists (abstract, first paragraph).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"An L#-inspired active learning algorithm learns minimal separating DFAs for disjoint languages when one exists and outperforms prior methods on random and industrial benchmarks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A simple algorithm based on L# learns minimal DFAs that separate two disjoint languages.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ac053c831fd4e238009c828e9a25bc16891615f91a099b5d7da35720c7989e26"},"source":{"id":"2605.15294","kind":"arxiv","version":1},"verdict":{"id":"2cc5c384-e066-4369-8a5b-9215e36a4427","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T15:47:36.624540Z","strongest_claim":"We propose a simple active learning algorithm, inspired by L#, that learns a minimal separating DFA for disjoint languages L1 and L2 if one exists.","one_line_summary":"An L#-inspired active learning algorithm learns minimal separating DFAs for disjoint languages when one exists and outperforms prior methods on random and industrial benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The two input languages are disjoint and a finite minimal separating DFA for them exists (abstract, first paragraph).","pith_extraction_headline":"A simple algorithm based on L# learns minimal DFAs that separate two disjoint languages."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15294/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:18.172475Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:54:18.005716Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:41:54.235608Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.784448Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"49de0ec6c5abff3ad628e76119cb9f7d40ff770f3beef4bb469dcd408ea484bf"},"references":{"count":36,"sample":[{"doi":"10.1016/0890-5401(87)90052-6","year":1987,"title":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987).https://doi.org/10.1016/0890-5401(87)90052-6","work_id":"24ae68d6-2697-487c-b493-1edef367e6de","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/s10994-013-5416-x","year":2014,"title":"Balle, B., Carreras, X., Luque, F.M., Quattoni, A.: Spectral learning of weighted automata - A forward-backward perspective. Mach. Learn.96(1-2), 33–63 (2014). https://doi.org/10.1007/S10994-013-5416-","work_id":"f4d77c54-8713-49b7-83e5-2ee837c97bc7","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.48550/arxiv.2308.15938","year":2062,"title":"Bar-Sinai, M., Elyasaf, A., Weiss, G., Weiss, Y.: Provengo: A tool suite for scenario driven model-based testing. In: ASE. pp. 2062–2065. IEEE (2023).https://doi. org/10.48550/ARXIV.2308.15938","work_id":"f6d0fc7d-3ebe-4285-a85e-0e5bfd7d7384","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/tc.1972.5009015","year":1972,"title":"IEEE Transactions on ComputersC-21(6), 592–597 (1972).https://doi.org/10.1109/TC.1972.5009015","work_id":"f58cd6cd-a568-4795-aef0-dd94c3c00e99","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/978-3-032-05792-1_3","year":2025,"title":"In: Prabhakar, P., Vandin, A","work_id":"7c6787d7-da98-443b-8c84-da0d66a08d5e","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":36,"snapshot_sha256":"13ba45bf0d01759f3ef00293c41bf00f564dbb4d91d3278fbab439ec61ea9575","internal_anchors":0},"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":"2cc5c384-e066-4369-8a5b-9215e36a4427"},"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:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gNuTM3QdQenpJRqbCiRuZmYCkUKbOXUCVX/TR1mkNVuEk9t7lYCMG8uOUOJFOnRQ15w9Pa+3JfINo1YLzuI2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T02:58:06.485901Z"},"content_sha256":"6942cced37f03807d12c03b1c363ec0bd25f5dc41e52829395f6bc4a90f577d3","schema_version":"1.0","event_id":"sha256:6942cced37f03807d12c03b1c363ec0bd25f5dc41e52829395f6bc4a90f577d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMR3XZRXDUCFWMFPQ6TKKW2PPB/bundle.json","state_url":"https://pith.science/pith/QMR3XZRXDUCFWMFPQ6TKKW2PPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMR3XZRXDUCFWMFPQ6TKKW2PPB/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:58:06Z","links":{"resolver":"https://pith.science/pith/QMR3XZRXDUCFWMFPQ6TKKW2PPB","bundle":"https://pith.science/pith/QMR3XZRXDUCFWMFPQ6TKKW2PPB/bundle.json","state":"https://pith.science/pith/QMR3XZRXDUCFWMFPQ6TKKW2PPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMR3XZRXDUCFWMFPQ6TKKW2PPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QMR3XZRXDUCFWMFPQ6TKKW2PPB","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":"3a2f8a217ab24c949beb3a597e8180f43719f1f75c26462d74ca2a67ec31982a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2026-05-14T18:10:19Z","title_canon_sha256":"93cf868a6be0cd0139d78001bdaed7e4160d109bdcc85eda2ddaf11d82a56353"},"schema_version":"1.0","source":{"id":"2605.15294","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15294","created_at":"2026-05-20T00:00:51Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15294v1","created_at":"2026-05-20T00:00:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15294","created_at":"2026-05-20T00:00:51Z"},{"alias_kind":"pith_short_12","alias_value":"QMR3XZRXDUCF","created_at":"2026-05-20T00:00:51Z"},{"alias_kind":"pith_short_16","alias_value":"QMR3XZRXDUCFWMFP","created_at":"2026-05-20T00:00:51Z"},{"alias_kind":"pith_short_8","alias_value":"QMR3XZRX","created_at":"2026-05-20T00:00:51Z"}],"graph_snapshots":[{"event_id":"sha256:6942cced37f03807d12c03b1c363ec0bd25f5dc41e52829395f6bc4a90f577d3","target":"graph","created_at":"2026-05-20T00:00:51Z","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 propose a simple active learning algorithm, inspired by L#, that learns a minimal separating DFA for disjoint languages L1 and L2 if one exists."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The two input languages are disjoint and a finite minimal separating DFA for them exists (abstract, first paragraph)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"An L#-inspired active learning algorithm learns minimal separating DFAs for disjoint languages when one exists and outperforms prior methods on random and industrial benchmarks."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A simple algorithm based on L# learns minimal DFAs that separate two disjoint languages."}],"snapshot_sha256":"ac053c831fd4e238009c828e9a25bc16891615f91a099b5d7da35720c7989e26"},"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-19T16:01:18.172475Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T15:54:18.005716Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:41:54.235608Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.784448Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15294/integrity.json","findings":[],"snapshot_sha256":"49de0ec6c5abff3ad628e76119cb9f7d40ff770f3beef4bb469dcd408ea484bf","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A DFA separates two disjoint languages $L_1$ and $L_2$ if it accepts every word in $L_1$ and rejects every word in $L_2$. Algorithms for active learning of small separating DFAs have many applications, e.g., for learning network invariants, learning contextual assumptions in compositional verification, learning state machines from large amounts of log data, and learning bug pattern descriptions. We propose a simple active learning algorithm, inspired by $L^{\\#}$, that learns a minimal separating DFA for disjoint languages $L_1$ and $L_2$ if one exists. Experiments show that our algorithm signi","authors_text":"Frits Vaandrager, Jasper Laumen, Leonne Snel","cross_cats":[],"headline":"A simple algorithm based on L# learns minimal DFAs that separate two disjoint languages.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2026-05-14T18:10:19Z","title":"An $L^{\\#}$ Based Algorithm for Active Learning of Minimal Separating Automata"},"references":{"count":36,"internal_anchors":0,"resolved_work":36,"sample":[{"cited_arxiv_id":"","doi":"10.1016/0890-5401(87)90052-6","is_internal_anchor":false,"ref_index":1,"title":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987).https://doi.org/10.1016/0890-5401(87)90052-6","work_id":"24ae68d6-2697-487c-b493-1edef367e6de","year":1987},{"cited_arxiv_id":"","doi":"10.1007/s10994-013-5416-x","is_internal_anchor":false,"ref_index":2,"title":"Balle, B., Carreras, X., Luque, F.M., Quattoni, A.: Spectral learning of weighted automata - A forward-backward perspective. Mach. Learn.96(1-2), 33–63 (2014). https://doi.org/10.1007/S10994-013-5416-","work_id":"f4d77c54-8713-49b7-83e5-2ee837c97bc7","year":2014},{"cited_arxiv_id":"","doi":"10.48550/arxiv.2308.15938","is_internal_anchor":false,"ref_index":3,"title":"Bar-Sinai, M., Elyasaf, A., Weiss, G., Weiss, Y.: Provengo: A tool suite for scenario driven model-based testing. In: ASE. pp. 2062–2065. IEEE (2023).https://doi. org/10.48550/ARXIV.2308.15938","work_id":"f6d0fc7d-3ebe-4285-a85e-0e5bfd7d7384","year":2062},{"cited_arxiv_id":"","doi":"10.1109/tc.1972.5009015","is_internal_anchor":false,"ref_index":4,"title":"IEEE Transactions on ComputersC-21(6), 592–597 (1972).https://doi.org/10.1109/TC.1972.5009015","work_id":"f58cd6cd-a568-4795-aef0-dd94c3c00e99","year":1972},{"cited_arxiv_id":"","doi":"10.1007/978-3-032-05792-1_3","is_internal_anchor":false,"ref_index":5,"title":"In: Prabhakar, P., Vandin, A","work_id":"7c6787d7-da98-443b-8c84-da0d66a08d5e","year":2025}],"snapshot_sha256":"13ba45bf0d01759f3ef00293c41bf00f564dbb4d91d3278fbab439ec61ea9575"},"source":{"id":"2605.15294","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T15:47:36.624540Z","id":"2cc5c384-e066-4369-8a5b-9215e36a4427","model_set":{"reader":"grok-4.3"},"one_line_summary":"An L#-inspired active learning algorithm learns minimal separating DFAs for disjoint languages when one exists and outperforms prior methods on random and industrial benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A simple algorithm based on L# learns minimal DFAs that separate two disjoint languages.","strongest_claim":"We propose a simple active learning algorithm, inspired by L#, that learns a minimal separating DFA for disjoint languages L1 and L2 if one exists.","weakest_assumption":"The two input languages are disjoint and a finite minimal separating DFA for them exists (abstract, first paragraph)."}},"verdict_id":"2cc5c384-e066-4369-8a5b-9215e36a4427"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:756a1479ddbe5951144b6e83d63862a4e30151727f7057b523b50f5f3a702ba5","target":"record","created_at":"2026-05-20T00:00:51Z","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":"3a2f8a217ab24c949beb3a597e8180f43719f1f75c26462d74ca2a67ec31982a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2026-05-14T18:10:19Z","title_canon_sha256":"93cf868a6be0cd0139d78001bdaed7e4160d109bdcc85eda2ddaf11d82a56353"},"schema_version":"1.0","source":{"id":"2605.15294","kind":"arxiv","version":1}},"canonical_sha256":"8323bbe6371d045b30af87a6a55b4f7845a0b5340d60414bb78cbf99e7a4b36e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8323bbe6371d045b30af87a6a55b4f7845a0b5340d60414bb78cbf99e7a4b36e","first_computed_at":"2026-05-20T00:00:51.136782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:51.136782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"slt2Eq5RHWqXshIEC9dvFk6tWjPTPoDK8TI/GbgW2yJl9YBGgn7Uwa+DcCE0yprSj8R6i8VvuFiK3XE2sMVbAQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:51.137564Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15294","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:756a1479ddbe5951144b6e83d63862a4e30151727f7057b523b50f5f3a702ba5","sha256:6942cced37f03807d12c03b1c363ec0bd25f5dc41e52829395f6bc4a90f577d3"],"state_sha256":"19f8d22b8b8fbe77d8fad0b2edfc56d7cdab172393f40d278cfc81e7b7d44b7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ISYqyAr235nmvYMxjr3AABMpStlCCVctNvhNhSRwRDCxJEtZXFMvbzbJaEwjiRokyA+AYPMs0uUoCn+4HmLwCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T02:58:06.490620Z","bundle_sha256":"f78fff523fbb939c2a58ae3f597702d4b67e36f07ec713e50870e58255f04531"}}