{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZUBDPEMMNCB6K6JS3TXZ5COPCR","short_pith_number":"pith:ZUBDPEMM","schema_version":"1.0","canonical_sha256":"cd0237918c6883e57932dcef9e89cf146f04fb5f98b86a3a64fd195cd04a0e44","source":{"kind":"arxiv","id":"2505.24478","version":1},"attestation_state":"computed","paper":{"title":"Optimizing the Interface Between Knowledge Graphs and LLMs for Complex Reasoning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Jovan Pavlovic, Laszlo Hajdu, Lazar Obradovic, Vasilije Markovic","submitted_at":"2025-05-30T11:27:59Z","abstract_excerpt":"Integrating Large Language Models (LLMs) with Knowledge Graphs (KGs) results in complex systems with numerous hyperparameters that directly affect performance. While such systems are increasingly common in retrieval-augmented generation, the role of systematic hyperparameter optimization remains underexplored. In this paper, we study this problem in the context of Cognee, a modular framework for end-to-end KG construction and retrieval. Using three multi-hop QA benchmarks (HotPotQA, TwoWikiMultiHop, and MuSiQue) we optimize parameters related to chunking, graph construction, retrieval, and pro"},"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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2505.24478","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2025-05-30T11:27:59Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"e9c5046fe9aeace10584cdd1e52acbdef09f307cc6a8a4f14a04c012c4bd4d52","abstract_canon_sha256":"d9bed532ae54f7277abda8f4a997f0b9855ef1c5f4b47a8147f4956e808fc9b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:50.687228Z","signature_b64":"NHpd0gWbft9GdpFJsw77VwJjNfYempOi49+VHs8g0rKvANXN+5cUMt3wEn/E0UbXaVdhgFLNqoQhZGAAgzo/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd0237918c6883e57932dcef9e89cf146f04fb5f98b86a3a64fd195cd04a0e44","last_reissued_at":"2026-07-05T11:12:50.686716Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:50.686716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing the Interface Between Knowledge Graphs and LLMs for Complex Reasoning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Jovan Pavlovic, Laszlo Hajdu, Lazar Obradovic, Vasilije Markovic","submitted_at":"2025-05-30T11:27:59Z","abstract_excerpt":"Integrating Large Language Models (LLMs) with Knowledge Graphs (KGs) results in complex systems with numerous hyperparameters that directly affect performance. While such systems are increasingly common in retrieval-augmented generation, the role of systematic hyperparameter optimization remains underexplored. In this paper, we study this problem in the context of Cognee, a modular framework for end-to-end KG construction and retrieval. Using three multi-hop QA benchmarks (HotPotQA, TwoWikiMultiHop, and MuSiQue) we optimize parameters related to chunking, graph construction, retrieval, and pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24478","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.24478/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.24478","created_at":"2026-07-05T11:12:50.686791+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.24478v1","created_at":"2026-07-05T11:12:50.686791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24478","created_at":"2026-07-05T11:12:50.686791+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZUBDPEMMNCB6","created_at":"2026-07-05T11:12:50.686791+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZUBDPEMMNCB6K6JS","created_at":"2026-07-05T11:12:50.686791+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZUBDPEMM","created_at":"2026-07-05T11:12:50.686791+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24775","citing_title":"Are We Ready For An Agent-Native Memory System?","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2507.05257","citing_title":"Evaluating Memory in LLM Agents via Incremental Multi-Turn Interactions","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2507.07957","citing_title":"MIRIX: Multi-Agent Memory System for LLM-Based Agents","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZUBDPEMMNCB6K6JS3TXZ5COPCR","json":"https://pith.science/pith/ZUBDPEMMNCB6K6JS3TXZ5COPCR.json","graph_json":"https://pith.science/api/pith-number/ZUBDPEMMNCB6K6JS3TXZ5COPCR/graph.json","events_json":"https://pith.science/api/pith-number/ZUBDPEMMNCB6K6JS3TXZ5COPCR/events.json","paper":"https://pith.science/paper/ZUBDPEMM"},"agent_actions":{"view_html":"https://pith.science/pith/ZUBDPEMMNCB6K6JS3TXZ5COPCR","download_json":"https://pith.science/pith/ZUBDPEMMNCB6K6JS3TXZ5COPCR.json","view_paper":"https://pith.science/paper/ZUBDPEMM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.24478&json=true","fetch_graph":"https://pith.science/api/pith-number/ZUBDPEMMNCB6K6JS3TXZ5COPCR/graph.json","fetch_events":"https://pith.science/api/pith-number/ZUBDPEMMNCB6K6JS3TXZ5COPCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZUBDPEMMNCB6K6JS3TXZ5COPCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZUBDPEMMNCB6K6JS3TXZ5COPCR/action/storage_attestation","attest_author":"https://pith.science/pith/ZUBDPEMMNCB6K6JS3TXZ5COPCR/action/author_attestation","sign_citation":"https://pith.science/pith/ZUBDPEMMNCB6K6JS3TXZ5COPCR/action/citation_signature","submit_replication":"https://pith.science/pith/ZUBDPEMMNCB6K6JS3TXZ5COPCR/action/replication_record"}},"created_at":"2026-07-05T11:12:50.686791+00:00","updated_at":"2026-07-05T11:12:50.686791+00:00"}