{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4JJMF4R3GTF3W723I4JV6MOE4I","short_pith_number":"pith:4JJMF4R3","canonical_record":{"source":{"id":"2605.13367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T11:26:32Z","cross_cats_sorted":["cs.AI","cs.DB"],"title_canon_sha256":"89370f1f4167e23ac4ade360374dba2c0abfe0eeccc7c1606452a9cd0d6918bc","abstract_canon_sha256":"56546afebd4a633d98f1e03b7a230906ffaad701c26b1a8dbc497006acf2c4b7"},"schema_version":"1.0"},"canonical_sha256":"e252c2f23b34cbbb7f5b47135f31c4e2034cfd87de8c3ca4c57b9e62b5479446","source":{"kind":"arxiv","id":"2605.13367","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13367","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13367v1","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13367","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"4JJMF4R3GTF3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"4JJMF4R3GTF3W723","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"4JJMF4R3","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4JJMF4R3GTF3W723I4JV6MOE4I","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T11:26:32Z","cross_cats_sorted":["cs.AI","cs.DB"],"title_canon_sha256":"89370f1f4167e23ac4ade360374dba2c0abfe0eeccc7c1606452a9cd0d6918bc","abstract_canon_sha256":"56546afebd4a633d98f1e03b7a230906ffaad701c26b1a8dbc497006acf2c4b7"},"schema_version":"1.0"},"canonical_sha256":"e252c2f23b34cbbb7f5b47135f31c4e2034cfd87de8c3ca4c57b9e62b5479446","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:48.047539Z","signature_b64":"tf71ZbHEprS3aLZaMZsr5+0/byT1VRYbVVD8T+OLAcde7kQlCHJazww1X3r84MyVyE/IqN+Q0P0gDD2SX7OpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e252c2f23b34cbbb7f5b47135f31c4e2034cfd87de8c3ca4c57b9e62b5479446","last_reissued_at":"2026-05-18T02:44:48.047082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:48.047082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13367","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-18T02:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1oChVd30GKE3tCzYKmUeuAhYVAd2tA0x8pqnlpZVN4QXmwAxC0Raxeqqd/7qgeRBzeyd5rePI7cJWmvRUcQ2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:08:26.454886Z"},"content_sha256":"70fddd75a97fd48c89790971e55a2308215732353757fb0ee11f0e03483fe688","schema_version":"1.0","event_id":"sha256:70fddd75a97fd48c89790971e55a2308215732353757fb0ee11f0e03483fe688"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4JJMF4R3GTF3W723I4JV6MOE4I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Horn extension of DL-Lite with NL data complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"ELbotpreceq extends core DL-Lite with reachability axioms and restricted conjunction while keeping reasoning in NL data complexity.","cross_cats":["cs.AI","cs.DB"],"primary_cat":"cs.LO","authors_text":"Bartosz Jan Bednarczyk, Janos Arpasi, Magdalena Ortiz","submitted_at":"2026-05-13T11:26:32Z","abstract_excerpt":"The literature on ontology-mediated query answering (OMQA) has been shaped by two key results: first-order rewritability for DL-Lite, and PTime-hardness of data complexity for essentially every description logic beyond it. This has effectively positioned DL-Lite as the only practical choice for query rewriting, restricting OMQA solutions to first-order queries and ontologies that can be rewritten into them. This AC0 vs. PTime dichotomy is especially limiting if we consider that OMQA targets graph-structured data, and that standard graph query languages (including the recent ISO standards GQL a"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we obtain ELbotpreceq, a description logic that strictly extends the core DL-Lite, supports reachability axioms and restricted conjunction, and allows for reasoning in NL. We establish the NL upper bound via a rewriting into nested two-way regular path queries","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The stratification mechanism controls the interaction between conjunction and recursion sufficiently to preserve NL complexity while still extending DL-Lite expressivity in the intended way.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"ELbotpreceq extends DL-Lite with reachability and limited conjunction while keeping NL reasoning complexity through rewriting into nested two-way regular path queries.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"ELbotpreceq extends core DL-Lite with reachability axioms and restricted conjunction while keeping reasoning in NL data complexity.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"937cb0376e7a15d2e109bff01dd31f85bd747a439133434b5a0a93f6856f3499"},"source":{"id":"2605.13367","kind":"arxiv","version":1},"verdict":{"id":"bf00eeb7-a654-484a-8166-797e9fc4cfc3","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:45:33.108190Z","strongest_claim":"we obtain ELbotpreceq, a description logic that strictly extends the core DL-Lite, supports reachability axioms and restricted conjunction, and allows for reasoning in NL. We establish the NL upper bound via a rewriting into nested two-way regular path queries","one_line_summary":"ELbotpreceq extends DL-Lite with reachability and limited conjunction while keeping NL reasoning complexity through rewriting into nested two-way regular path queries.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The stratification mechanism controls the interaction between conjunction and recursion sufficiently to preserve NL complexity while still extending DL-Lite expressivity in the intended way.","pith_extraction_headline":"ELbotpreceq extends core DL-Lite with reachability axioms and restricted conjunction while keeping reasoning in NL data complexity."},"references":{"count":23,"sample":[{"doi":"","year":2007,"title":"D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, R. Rosati, Tractable reasoning and efficient query answering in description logics: The DL-Lite family, Journal of Automated Reasoning (2007)","work_id":"91c09326-7b32-46bf-97a8-dda54df6fb1c","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, R. Rosati, Data complexity of query answering in description logics, Artificial Intelligence (2013)","work_id":"06e5b5f9-20c2-4510-be95-36258c8196dd","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"L. Libkin, W. Martens, F. Murlak, L. Peterfreund, D. Vrgoc, Querying graph data: Where we are and where to go, in: PODS 2025, ACM, 2025","work_id":"9bca9183-fadb-425f-bf42-62eb870a9fb4","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"N. Francis, A. Gheerbrant, P. Guagliardo, L. Libkin, V. Marsault, W. Martens, F. Murlak, L. Peter- freund, A. Rogova, D. Vrgoc, A researcher’s digest of GQL (invited talk), in: ICDT 2023, LIPIcs, Schl","work_id":"530863af-dfd3-41f8-a7a9-bdb00b8dce46","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"M. Bienvenu, M. Ortiz, M. Šimkus, Regular path queries in lightweight description logics: Com- plexity and algorithms, Journal of Artificial Intelligence Research (2015)","work_id":"9e0a54c3-1a94-48cd-a6bc-9f4ec7203f56","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":23,"snapshot_sha256":"9a9f4c38b7d9caea2fb7db2cdb84af93fe517a0abe4a98e0100f821e36e34b1b","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":"bf00eeb7-a654-484a-8166-797e9fc4cfc3"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hc2xErxSj+js/wv70gtH3j1bHMGpYhFT7sENxuGFUS8EyN8JaMz6iZRUmkeNxZJuBIhZ5m0ub6cJtOGWDJyOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:08:26.455546Z"},"content_sha256":"dba521f56daa2e330c6dc2f184935968f6db4c0679685a85f22958747bc15883","schema_version":"1.0","event_id":"sha256:dba521f56daa2e330c6dc2f184935968f6db4c0679685a85f22958747bc15883"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JJMF4R3GTF3W723I4JV6MOE4I/bundle.json","state_url":"https://pith.science/pith/4JJMF4R3GTF3W723I4JV6MOE4I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JJMF4R3GTF3W723I4JV6MOE4I/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-06-03T05:08:26Z","links":{"resolver":"https://pith.science/pith/4JJMF4R3GTF3W723I4JV6MOE4I","bundle":"https://pith.science/pith/4JJMF4R3GTF3W723I4JV6MOE4I/bundle.json","state":"https://pith.science/pith/4JJMF4R3GTF3W723I4JV6MOE4I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JJMF4R3GTF3W723I4JV6MOE4I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4JJMF4R3GTF3W723I4JV6MOE4I","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":"56546afebd4a633d98f1e03b7a230906ffaad701c26b1a8dbc497006acf2c4b7","cross_cats_sorted":["cs.AI","cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T11:26:32Z","title_canon_sha256":"89370f1f4167e23ac4ade360374dba2c0abfe0eeccc7c1606452a9cd0d6918bc"},"schema_version":"1.0","source":{"id":"2605.13367","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13367","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13367v1","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13367","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"4JJMF4R3GTF3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"4JJMF4R3GTF3W723","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"4JJMF4R3","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:dba521f56daa2e330c6dc2f184935968f6db4c0679685a85f22958747bc15883","target":"graph","created_at":"2026-05-18T02:44:48Z","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 obtain ELbotpreceq, a description logic that strictly extends the core DL-Lite, supports reachability axioms and restricted conjunction, and allows for reasoning in NL. We establish the NL upper bound via a rewriting into nested two-way regular path queries"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The stratification mechanism controls the interaction between conjunction and recursion sufficiently to preserve NL complexity while still extending DL-Lite expressivity in the intended way."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"ELbotpreceq extends DL-Lite with reachability and limited conjunction while keeping NL reasoning complexity through rewriting into nested two-way regular path queries."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"ELbotpreceq extends core DL-Lite with reachability axioms and restricted conjunction while keeping reasoning in NL data complexity."}],"snapshot_sha256":"937cb0376e7a15d2e109bff01dd31f85bd747a439133434b5a0a93f6856f3499"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The literature on ontology-mediated query answering (OMQA) has been shaped by two key results: first-order rewritability for DL-Lite, and PTime-hardness of data complexity for essentially every description logic beyond it. This has effectively positioned DL-Lite as the only practical choice for query rewriting, restricting OMQA solutions to first-order queries and ontologies that can be rewritten into them. This AC0 vs. PTime dichotomy is especially limiting if we consider that OMQA targets graph-structured data, and that standard graph query languages (including the recent ISO standards GQL a","authors_text":"Bartosz Jan Bednarczyk, Janos Arpasi, Magdalena Ortiz","cross_cats":["cs.AI","cs.DB"],"headline":"ELbotpreceq extends core DL-Lite with reachability axioms and restricted conjunction while keeping reasoning in NL data complexity.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T11:26:32Z","title":"A Horn extension of DL-Lite with NL data complexity"},"references":{"count":23,"internal_anchors":0,"resolved_work":23,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, R. Rosati, Tractable reasoning and efficient query answering in description logics: The DL-Lite family, Journal of Automated Reasoning (2007)","work_id":"91c09326-7b32-46bf-97a8-dda54df6fb1c","year":2007},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, R. Rosati, Data complexity of query answering in description logics, Artificial Intelligence (2013)","work_id":"06e5b5f9-20c2-4510-be95-36258c8196dd","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"L. Libkin, W. Martens, F. Murlak, L. Peterfreund, D. Vrgoc, Querying graph data: Where we are and where to go, in: PODS 2025, ACM, 2025","work_id":"9bca9183-fadb-425f-bf42-62eb870a9fb4","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"N. Francis, A. Gheerbrant, P. Guagliardo, L. Libkin, V. Marsault, W. Martens, F. Murlak, L. Peter- freund, A. Rogova, D. Vrgoc, A researcher’s digest of GQL (invited talk), in: ICDT 2023, LIPIcs, Schl","work_id":"530863af-dfd3-41f8-a7a9-bdb00b8dce46","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"M. Bienvenu, M. Ortiz, M. Šimkus, Regular path queries in lightweight description logics: Com- plexity and algorithms, Journal of Artificial Intelligence Research (2015)","work_id":"9e0a54c3-1a94-48cd-a6bc-9f4ec7203f56","year":2015}],"snapshot_sha256":"9a9f4c38b7d9caea2fb7db2cdb84af93fe517a0abe4a98e0100f821e36e34b1b"},"source":{"id":"2605.13367","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:45:33.108190Z","id":"bf00eeb7-a654-484a-8166-797e9fc4cfc3","model_set":{"reader":"grok-4.3"},"one_line_summary":"ELbotpreceq extends DL-Lite with reachability and limited conjunction while keeping NL reasoning complexity through rewriting into nested two-way regular path queries.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"ELbotpreceq extends core DL-Lite with reachability axioms and restricted conjunction while keeping reasoning in NL data complexity.","strongest_claim":"we obtain ELbotpreceq, a description logic that strictly extends the core DL-Lite, supports reachability axioms and restricted conjunction, and allows for reasoning in NL. We establish the NL upper bound via a rewriting into nested two-way regular path queries","weakest_assumption":"The stratification mechanism controls the interaction between conjunction and recursion sufficiently to preserve NL complexity while still extending DL-Lite expressivity in the intended way."}},"verdict_id":"bf00eeb7-a654-484a-8166-797e9fc4cfc3"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:70fddd75a97fd48c89790971e55a2308215732353757fb0ee11f0e03483fe688","target":"record","created_at":"2026-05-18T02:44:48Z","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":"56546afebd4a633d98f1e03b7a230906ffaad701c26b1a8dbc497006acf2c4b7","cross_cats_sorted":["cs.AI","cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T11:26:32Z","title_canon_sha256":"89370f1f4167e23ac4ade360374dba2c0abfe0eeccc7c1606452a9cd0d6918bc"},"schema_version":"1.0","source":{"id":"2605.13367","kind":"arxiv","version":1}},"canonical_sha256":"e252c2f23b34cbbb7f5b47135f31c4e2034cfd87de8c3ca4c57b9e62b5479446","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e252c2f23b34cbbb7f5b47135f31c4e2034cfd87de8c3ca4c57b9e62b5479446","first_computed_at":"2026-05-18T02:44:48.047082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:48.047082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tf71ZbHEprS3aLZaMZsr5+0/byT1VRYbVVD8T+OLAcde7kQlCHJazww1X3r84MyVyE/IqN+Q0P0gDD2SX7OpCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:48.047539Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13367","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70fddd75a97fd48c89790971e55a2308215732353757fb0ee11f0e03483fe688","sha256:dba521f56daa2e330c6dc2f184935968f6db4c0679685a85f22958747bc15883"],"state_sha256":"4b946210d8a7a8d2a54b7760af797e5570428896e4940ddcb4b93665b4518f2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8qsIChkISx6+yAc1g+t5n/2D9LiTRroSyT5V/7W6gTfWCopqri4adDb07+QR7YY5VvG140prjNaSNbH1izwZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:08:26.458139Z","bundle_sha256":"bda92db4868dd9424a3c809d7f25ed14cf1ba54a31688f225b6d885f0c701432"}}