{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CLPPRJ4KB5HZESTCIE6BPUTGDG","short_pith_number":"pith:CLPPRJ4K","schema_version":"1.0","canonical_sha256":"12def8a78a0f4f924a62413c17d266199e7da69c9e49966a9351e4fff5ad3805","source":{"kind":"arxiv","id":"2606.30133","version":1},"attestation_state":"computed","paper":{"title":"Query-Aware Spreading Activation for Multi-Hop Retrieval over Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.LG","authors_text":"Illia Makarov, Mykola Glybovets","submitted_at":"2026-06-29T11:10:19Z","abstract_excerpt":"Retrieval-augmented generation built on knowledge graphs (Graph RAG) outperforms flat passage retrieval on multi-hop question answering by leveraging graph structure. In most existing systems, however, the question only sets the seed nodes; the subsequent traversal becomes \"query-blind\", depending solely on the graph structure. The exception is QAFD-RAG, which implements query-aware traversal via a flow-diffusion solver with combined edge re-weighting. This architecture requires loading the full graph into Python memory and an iterative solver with a variable number of iterations complicating "},"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":"2606.30133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-29T11:10:19Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"59a80d952344f56fd000d4ba7cc04819ee147552ee8e525d97101c24a6d40c5d","abstract_canon_sha256":"4a667e7c72c7f038a948f62254bd66acece8be02fda73da83ca2f52ab980b1ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:17:50.958700Z","signature_b64":"4ENDr8trJIjvWsf7XNb2XEqhxN3T5Gyr3LPSI15qry8dJdJwBcqgAAFtTBm4bv8YbzRFbDeaihirB1K0Y0grBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12def8a78a0f4f924a62413c17d266199e7da69c9e49966a9351e4fff5ad3805","last_reissued_at":"2026-06-30T02:17:50.958012Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:17:50.958012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Query-Aware Spreading Activation for Multi-Hop Retrieval over Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.LG","authors_text":"Illia Makarov, Mykola Glybovets","submitted_at":"2026-06-29T11:10:19Z","abstract_excerpt":"Retrieval-augmented generation built on knowledge graphs (Graph RAG) outperforms flat passage retrieval on multi-hop question answering by leveraging graph structure. In most existing systems, however, the question only sets the seed nodes; the subsequent traversal becomes \"query-blind\", depending solely on the graph structure. The exception is QAFD-RAG, which implements query-aware traversal via a flow-diffusion solver with combined edge re-weighting. This architecture requires loading the full graph into Python memory and an iterative solver with a variable number of iterations complicating "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30133","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/2606.30133/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":"2606.30133","created_at":"2026-06-30T02:17:50.958114+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.30133v1","created_at":"2026-06-30T02:17:50.958114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30133","created_at":"2026-06-30T02:17:50.958114+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLPPRJ4KB5HZ","created_at":"2026-06-30T02:17:50.958114+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLPPRJ4KB5HZESTC","created_at":"2026-06-30T02:17:50.958114+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLPPRJ4K","created_at":"2026-06-30T02:17:50.958114+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/CLPPRJ4KB5HZESTCIE6BPUTGDG","json":"https://pith.science/pith/CLPPRJ4KB5HZESTCIE6BPUTGDG.json","graph_json":"https://pith.science/api/pith-number/CLPPRJ4KB5HZESTCIE6BPUTGDG/graph.json","events_json":"https://pith.science/api/pith-number/CLPPRJ4KB5HZESTCIE6BPUTGDG/events.json","paper":"https://pith.science/paper/CLPPRJ4K"},"agent_actions":{"view_html":"https://pith.science/pith/CLPPRJ4KB5HZESTCIE6BPUTGDG","download_json":"https://pith.science/pith/CLPPRJ4KB5HZESTCIE6BPUTGDG.json","view_paper":"https://pith.science/paper/CLPPRJ4K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.30133&json=true","fetch_graph":"https://pith.science/api/pith-number/CLPPRJ4KB5HZESTCIE6BPUTGDG/graph.json","fetch_events":"https://pith.science/api/pith-number/CLPPRJ4KB5HZESTCIE6BPUTGDG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLPPRJ4KB5HZESTCIE6BPUTGDG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLPPRJ4KB5HZESTCIE6BPUTGDG/action/storage_attestation","attest_author":"https://pith.science/pith/CLPPRJ4KB5HZESTCIE6BPUTGDG/action/author_attestation","sign_citation":"https://pith.science/pith/CLPPRJ4KB5HZESTCIE6BPUTGDG/action/citation_signature","submit_replication":"https://pith.science/pith/CLPPRJ4KB5HZESTCIE6BPUTGDG/action/replication_record"}},"created_at":"2026-06-30T02:17:50.958114+00:00","updated_at":"2026-06-30T02:17:50.958114+00:00"}