{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:3YFV42NP7N4Y7BXHMNLLI5UTEQ","short_pith_number":"pith:3YFV42NP","canonical_record":{"source":{"id":"2605.13481","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T13:06:30Z","cross_cats_sorted":[],"title_canon_sha256":"8a7031f0b151a167714ccc193e4b0b63686ff2f904da2d0c8d87cd9e69f02b32","abstract_canon_sha256":"26e3cea5d5064786d8a7f738059925406b96f9ed46d86e1975a11e7b8b9dcc15"},"schema_version":"1.0"},"canonical_sha256":"de0b5e69affb798f86e76356b47693242d8d2179a4264b86779cfc3d165a3ed0","source":{"kind":"arxiv","id":"2605.13481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13481","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13481v1","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13481","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"pith_short_12","alias_value":"3YFV42NP7N4Y","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"3YFV42NP7N4Y7BXH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"3YFV42NP","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:3YFV42NP7N4Y7BXHMNLLI5UTEQ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13481","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T13:06:30Z","cross_cats_sorted":[],"title_canon_sha256":"8a7031f0b151a167714ccc193e4b0b63686ff2f904da2d0c8d87cd9e69f02b32","abstract_canon_sha256":"26e3cea5d5064786d8a7f738059925406b96f9ed46d86e1975a11e7b8b9dcc15"},"schema_version":"1.0"},"canonical_sha256":"de0b5e69affb798f86e76356b47693242d8d2179a4264b86779cfc3d165a3ed0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:41.366335Z","signature_b64":"6WrmTLW7aFQEKcqfST7ns9Os0bS2yCX4hx+lWQzB8LMvlSXS6LCftcDbROq53cbG0fi4jlP3H3LoF6s/YLbbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de0b5e69affb798f86e76356b47693242d8d2179a4264b86779cfc3d165a3ed0","last_reissued_at":"2026-05-18T02:44:41.365725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:41.365725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13481","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:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N/OnMsPb0pxdFb7xIcCvanOgHoLJ/cPbumgQGt0MR5vyxn8bt0PMi0er0uEqj1hjeVtTciR9idEp4ZvC9b3ZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:16:26.432805Z"},"content_sha256":"4e8ea4e18bca6a983c5bd94e1186354efeca8e0b58e146203cc677323d0de263","schema_version":"1.0","event_id":"sha256:4e8ea4e18bca6a983c5bd94e1186354efeca8e0b58e146203cc677323d0de263"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:3YFV42NP7N4Y7BXHMNLLI5UTEQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PersonalAI 2.0: Enhancing knowledge graph traversal/retrieval with planning mechanism for Personalized LLM Agents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"PAI-2 improves LLM factual accuracy through adaptive graph traversal and planning on knowledge graphs.","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Alexander Kharitonov, Alina Bogdanova, Artyom Sosedka, Ekaterina Lisitsyna, Evgeny Burnaev, Ilia Perepechkin, Matvey Iskornev, Mikhail Belkin, Mikhail Menschikov, Ruslan Kostoev, Victoria Dochkina","submitted_at":"2026-05-13T13:06:30Z","abstract_excerpt":"We introduce PersonalAI 2.0 (PAI-2), a novel framework, designed to enhance large language model (LLM) based systems through integration of external knowledge graphs (KG). The proposed approach addresses key limitations of existing Graph Retrieval-Augmented Generation (GraphRAG) methods by incorporating a dynamic, multistage query processing pipeline. The central point of PAI-2 design is its ability to perform adaptive, iterative information search, guided by extracted entities, matched graph vertices and generated clue-queries. Conducted evaluation over six benchmarks (Natural Questions, Triv"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"PAI-2 achieves 4% average gain by LLM-as-a-Judge across four benchmarks, reflecting its effectiveness in reducing hallucination rates and increasing precision. Use of graph traversal algorithms gain superior results compared to standard flatten retriever on average 6%, while enabled search plan enhancement mechanism gain 18% boost compared to disabled one by LLM-as-a-Judge across six datasets.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the reported benchmark gains from the planning and traversal mechanisms will generalize beyond the six evaluated datasets and the specific LLMs tested, and that LLM-as-a-Judge reliably measures factual correctness without introducing its own biases.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"PAI-2 improves factual correctness in LLM answers by 4% on average across benchmarks using adaptive graph traversal and planning, with 6% gains from traversal algorithms and 18% from enabled planning.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"PAI-2 improves LLM factual accuracy through adaptive graph traversal and planning on knowledge graphs.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"129c7ff8251de1d7a3888b27ca64190c532dff92044e0c5e68d5481dccdee9d1"},"source":{"id":"2605.13481","kind":"arxiv","version":1},"verdict":{"id":"131a56eb-59a9-433c-8d2e-e97284a29d59","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:11:58.043032Z","strongest_claim":"PAI-2 achieves 4% average gain by LLM-as-a-Judge across four benchmarks, reflecting its effectiveness in reducing hallucination rates and increasing precision. Use of graph traversal algorithms gain superior results compared to standard flatten retriever on average 6%, while enabled search plan enhancement mechanism gain 18% boost compared to disabled one by LLM-as-a-Judge across six datasets.","one_line_summary":"PAI-2 improves factual correctness in LLM answers by 4% on average across benchmarks using adaptive graph traversal and planning, with 6% gains from traversal algorithms and 18% from enabled planning.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the reported benchmark gains from the planning and traversal mechanisms will generalize beyond the six evaluated datasets and the specific LLMs tested, and that LLM-as-a-Judge reliably measures factual correctness without introducing its own biases.","pith_extraction_headline":"PAI-2 improves LLM factual accuracy through adaptive graph traversal and planning on knowledge graphs."},"references":{"count":40,"sample":[{"doi":"","year":2025,"title":"Qwen3 technical report, 2025","work_id":"25520164-3a3c-4e1d-859b-33ac0664fb0a","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"DeepSeek-AI, Aixin Liu, Bei Feng, Bing Xue, Bingxuan Wang, Bochao Wu, Chengda Lu, Chenggang Zhao, Chengqi Deng, Chenyu Zhang, Chong Ruan, Damai Dai, Daya Guo, Dejian Y ang, Deli Chen, Dongjie Ji, Erha","work_id":"6c91e37a-9316-4c7b-b73c-d24458f40dde","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Glm-4.5: Agentic, reasoning, and coding (arc) foundation models, 2025","work_id":"92c05c04-1be1-4ce0-8e20-fa4d484d5753","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"Wikontic: Constructing Wikidata-aligned, ontology-aware knowledge graphs with large language models","work_id":"62698cbe-c7e2-4038-9524-3de1c0ce9b5b","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Autoschemakg: Autonomous knowledge graph construction through dynamic schema induction from web-scale corpora, 2025","work_id":"e85beb3a-1aaf-4a0b-a1e4-7c1e31f975f6","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":40,"snapshot_sha256":"7f2da35eaa59b8126b7745601aa458094cac082ff213adf30f29c1398d4c296f","internal_anchors":3},"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":"131a56eb-59a9-433c-8d2e-e97284a29d59"},"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:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xqP4s0GAq0OKR5bEnP6iHraU/dNuvmEEZThsqiO4VPwTp5CUAipqTVsU093DVti4ISpJo44/DpZ72ahCFKgcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:16:26.433801Z"},"content_sha256":"83b9d0ae59f5537a8927b76d9f8e2c15e54d78a8329c1e89606c58c2c9d997e5","schema_version":"1.0","event_id":"sha256:83b9d0ae59f5537a8927b76d9f8e2c15e54d78a8329c1e89606c58c2c9d997e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YFV42NP7N4Y7BXHMNLLI5UTEQ/bundle.json","state_url":"https://pith.science/pith/3YFV42NP7N4Y7BXHMNLLI5UTEQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YFV42NP7N4Y7BXHMNLLI5UTEQ/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-27T19:16:26Z","links":{"resolver":"https://pith.science/pith/3YFV42NP7N4Y7BXHMNLLI5UTEQ","bundle":"https://pith.science/pith/3YFV42NP7N4Y7BXHMNLLI5UTEQ/bundle.json","state":"https://pith.science/pith/3YFV42NP7N4Y7BXHMNLLI5UTEQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YFV42NP7N4Y7BXHMNLLI5UTEQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3YFV42NP7N4Y7BXHMNLLI5UTEQ","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":"26e3cea5d5064786d8a7f738059925406b96f9ed46d86e1975a11e7b8b9dcc15","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T13:06:30Z","title_canon_sha256":"8a7031f0b151a167714ccc193e4b0b63686ff2f904da2d0c8d87cd9e69f02b32"},"schema_version":"1.0","source":{"id":"2605.13481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13481","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13481v1","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13481","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"pith_short_12","alias_value":"3YFV42NP7N4Y","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"3YFV42NP7N4Y7BXH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"3YFV42NP","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:83b9d0ae59f5537a8927b76d9f8e2c15e54d78a8329c1e89606c58c2c9d997e5","target":"graph","created_at":"2026-05-18T02:44:41Z","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":"PAI-2 achieves 4% average gain by LLM-as-a-Judge across four benchmarks, reflecting its effectiveness in reducing hallucination rates and increasing precision. Use of graph traversal algorithms gain superior results compared to standard flatten retriever on average 6%, while enabled search plan enhancement mechanism gain 18% boost compared to disabled one by LLM-as-a-Judge across six datasets."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the reported benchmark gains from the planning and traversal mechanisms will generalize beyond the six evaluated datasets and the specific LLMs tested, and that LLM-as-a-Judge reliably measures factual correctness without introducing its own biases."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"PAI-2 improves factual correctness in LLM answers by 4% on average across benchmarks using adaptive graph traversal and planning, with 6% gains from traversal algorithms and 18% from enabled planning."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"PAI-2 improves LLM factual accuracy through adaptive graph traversal and planning on knowledge graphs."}],"snapshot_sha256":"129c7ff8251de1d7a3888b27ca64190c532dff92044e0c5e68d5481dccdee9d1"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We introduce PersonalAI 2.0 (PAI-2), a novel framework, designed to enhance large language model (LLM) based systems through integration of external knowledge graphs (KG). The proposed approach addresses key limitations of existing Graph Retrieval-Augmented Generation (GraphRAG) methods by incorporating a dynamic, multistage query processing pipeline. The central point of PAI-2 design is its ability to perform adaptive, iterative information search, guided by extracted entities, matched graph vertices and generated clue-queries. Conducted evaluation over six benchmarks (Natural Questions, Triv","authors_text":"Alexander Kharitonov, Alina Bogdanova, Artyom Sosedka, Ekaterina Lisitsyna, Evgeny Burnaev, Ilia Perepechkin, Matvey Iskornev, Mikhail Belkin, Mikhail Menschikov, Ruslan Kostoev, Victoria Dochkina","cross_cats":[],"headline":"PAI-2 improves LLM factual accuracy through adaptive graph traversal and planning on knowledge graphs.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T13:06:30Z","title":"PersonalAI 2.0: Enhancing knowledge graph traversal/retrieval with planning mechanism for Personalized LLM Agents"},"references":{"count":40,"internal_anchors":3,"resolved_work":40,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Qwen3 technical report, 2025","work_id":"25520164-3a3c-4e1d-859b-33ac0664fb0a","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"DeepSeek-AI, Aixin Liu, Bei Feng, Bing Xue, Bingxuan Wang, Bochao Wu, Chengda Lu, Chenggang Zhao, Chengqi Deng, Chenyu Zhang, Chong Ruan, Damai Dai, Daya Guo, Dejian Y ang, Deli Chen, Dongjie Ji, Erha","work_id":"6c91e37a-9316-4c7b-b73c-d24458f40dde","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Glm-4.5: Agentic, reasoning, and coding (arc) foundation models, 2025","work_id":"92c05c04-1be1-4ce0-8e20-fa4d484d5753","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Wikontic: Constructing Wikidata-aligned, ontology-aware knowledge graphs with large language models","work_id":"62698cbe-c7e2-4038-9524-3de1c0ce9b5b","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Autoschemakg: Autonomous knowledge graph construction through dynamic schema induction from web-scale corpora, 2025","work_id":"e85beb3a-1aaf-4a0b-a1e4-7c1e31f975f6","year":2025}],"snapshot_sha256":"7f2da35eaa59b8126b7745601aa458094cac082ff213adf30f29c1398d4c296f"},"source":{"id":"2605.13481","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:11:58.043032Z","id":"131a56eb-59a9-433c-8d2e-e97284a29d59","model_set":{"reader":"grok-4.3"},"one_line_summary":"PAI-2 improves factual correctness in LLM answers by 4% on average across benchmarks using adaptive graph traversal and planning, with 6% gains from traversal algorithms and 18% from enabled planning.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"PAI-2 improves LLM factual accuracy through adaptive graph traversal and planning on knowledge graphs.","strongest_claim":"PAI-2 achieves 4% average gain by LLM-as-a-Judge across four benchmarks, reflecting its effectiveness in reducing hallucination rates and increasing precision. Use of graph traversal algorithms gain superior results compared to standard flatten retriever on average 6%, while enabled search plan enhancement mechanism gain 18% boost compared to disabled one by LLM-as-a-Judge across six datasets.","weakest_assumption":"That the reported benchmark gains from the planning and traversal mechanisms will generalize beyond the six evaluated datasets and the specific LLMs tested, and that LLM-as-a-Judge reliably measures factual correctness without introducing its own biases."}},"verdict_id":"131a56eb-59a9-433c-8d2e-e97284a29d59"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4e8ea4e18bca6a983c5bd94e1186354efeca8e0b58e146203cc677323d0de263","target":"record","created_at":"2026-05-18T02:44:41Z","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":"26e3cea5d5064786d8a7f738059925406b96f9ed46d86e1975a11e7b8b9dcc15","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T13:06:30Z","title_canon_sha256":"8a7031f0b151a167714ccc193e4b0b63686ff2f904da2d0c8d87cd9e69f02b32"},"schema_version":"1.0","source":{"id":"2605.13481","kind":"arxiv","version":1}},"canonical_sha256":"de0b5e69affb798f86e76356b47693242d8d2179a4264b86779cfc3d165a3ed0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de0b5e69affb798f86e76356b47693242d8d2179a4264b86779cfc3d165a3ed0","first_computed_at":"2026-05-18T02:44:41.365725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:41.365725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6WrmTLW7aFQEKcqfST7ns9Os0bS2yCX4hx+lWQzB8LMvlSXS6LCftcDbROq53cbG0fi4jlP3H3LoF6s/YLbbBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:41.366335Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e8ea4e18bca6a983c5bd94e1186354efeca8e0b58e146203cc677323d0de263","sha256:83b9d0ae59f5537a8927b76d9f8e2c15e54d78a8329c1e89606c58c2c9d997e5"],"state_sha256":"e396dac9b7dc85fa2600238bb7bc4802062dc9f5380d22c0f6c104ffcd3c9930"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vc/4aVIk3xDYXp4XbJRWo+F9yuYm6wW7r/3DfyCRqOrwZ12lM9TcbRvQRJrwlGQmwgyD2K2H860OtOK9C3MDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:16:26.438005Z","bundle_sha256":"839019627523066d591c7a3b859fe35e014b19e190fd98b6727e21440066c6a8"}}