{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3YFV42NP7N4Y7BXHMNLLI5UTEQ","short_pith_number":"pith:3YFV42NP","schema_version":"1.0","canonical_sha256":"de0b5e69affb798f86e76356b47693242d8d2179a4264b86779cfc3d165a3ed0","source":{"kind":"arxiv","id":"2605.13481","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.13481","created_at":"2026-05-18T02:44:41.365822+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13481v1","created_at":"2026-05-18T02:44:41.365822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13481","created_at":"2026-05-18T02:44:41.365822+00:00"},{"alias_kind":"pith_short_12","alias_value":"3YFV42NP7N4Y","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"3YFV42NP7N4Y7BXH","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"3YFV42NP","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3YFV42NP7N4Y7BXHMNLLI5UTEQ","json":"https://pith.science/pith/3YFV42NP7N4Y7BXHMNLLI5UTEQ.json","graph_json":"https://pith.science/api/pith-number/3YFV42NP7N4Y7BXHMNLLI5UTEQ/graph.json","events_json":"https://pith.science/api/pith-number/3YFV42NP7N4Y7BXHMNLLI5UTEQ/events.json","paper":"https://pith.science/paper/3YFV42NP"},"agent_actions":{"view_html":"https://pith.science/pith/3YFV42NP7N4Y7BXHMNLLI5UTEQ","download_json":"https://pith.science/pith/3YFV42NP7N4Y7BXHMNLLI5UTEQ.json","view_paper":"https://pith.science/paper/3YFV42NP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13481&json=true","fetch_graph":"https://pith.science/api/pith-number/3YFV42NP7N4Y7BXHMNLLI5UTEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/3YFV42NP7N4Y7BXHMNLLI5UTEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3YFV42NP7N4Y7BXHMNLLI5UTEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3YFV42NP7N4Y7BXHMNLLI5UTEQ/action/storage_attestation","attest_author":"https://pith.science/pith/3YFV42NP7N4Y7BXHMNLLI5UTEQ/action/author_attestation","sign_citation":"https://pith.science/pith/3YFV42NP7N4Y7BXHMNLLI5UTEQ/action/citation_signature","submit_replication":"https://pith.science/pith/3YFV42NP7N4Y7BXHMNLLI5UTEQ/action/replication_record"}},"created_at":"2026-05-18T02:44:41.365822+00:00","updated_at":"2026-05-18T02:44:41.365822+00:00"}