{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DXFRLWWVVUGRIZRSJDJL22EBEO","short_pith_number":"pith:DXFRLWWV","schema_version":"1.0","canonical_sha256":"1dcb15dad5ad0d14663248d2bd6881239ad914720ac9fe441c9989e1a6c0388e","source":{"kind":"arxiv","id":"2404.00492","version":1},"attestation_state":"computed","paper":{"title":"Multi-hop Question Answering under Temporal Knowledge Editing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Di Wang, Gang Lin, Haoyang Fei, Keyuan Cheng, Lijie Hu, Lu Yu, Muhammad Asif Ali, Yuxuan zhai","submitted_at":"2024-03-30T23:22:51Z","abstract_excerpt":"Multi-hop question answering (MQA) under knowledge editing (KE) has garnered significant attention in the era of large language models. However, existing models for MQA under KE exhibit poor performance when dealing with questions containing explicit temporal contexts. To address this limitation, we propose a novel framework, namely TEMPoral knowLEdge augmented Multi-hop Question Answering (TEMPLE-MQA). Unlike previous methods, TEMPLE-MQA first constructs a time-aware graph (TAG) to store edit knowledge in a structured manner. Then, through our proposed inference path, structural retrieval, an"},"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":"2404.00492","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-03-30T23:22:51Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"29dcfeca74cfdeec816954acbb9e61e4603a0ce58f7254b845ebe85f334d45ef","abstract_canon_sha256":"70b6a3a10d6dddd9422fa4fcbfc1ead37b43763a98c4ec272ae103ae35b36cd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:02:34.227472Z","signature_b64":"8z6GjFvJuOd/atLzc4kJMFGWEwG5urs6fIwuN94+4FmSqZnhe0f4vDkfTXeXmRDQZpGf/U3cOe90pReucIbQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dcb15dad5ad0d14663248d2bd6881239ad914720ac9fe441c9989e1a6c0388e","last_reissued_at":"2026-07-05T08:02:34.226994Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:02:34.226994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-hop Question Answering under Temporal Knowledge Editing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Di Wang, Gang Lin, Haoyang Fei, Keyuan Cheng, Lijie Hu, Lu Yu, Muhammad Asif Ali, Yuxuan zhai","submitted_at":"2024-03-30T23:22:51Z","abstract_excerpt":"Multi-hop question answering (MQA) under knowledge editing (KE) has garnered significant attention in the era of large language models. However, existing models for MQA under KE exhibit poor performance when dealing with questions containing explicit temporal contexts. To address this limitation, we propose a novel framework, namely TEMPoral knowLEdge augmented Multi-hop Question Answering (TEMPLE-MQA). Unlike previous methods, TEMPLE-MQA first constructs a time-aware graph (TAG) to store edit knowledge in a structured manner. Then, through our proposed inference path, structural retrieval, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.00492","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/2404.00492/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":"2404.00492","created_at":"2026-07-05T08:02:34.227055+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.00492v1","created_at":"2026-07-05T08:02:34.227055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.00492","created_at":"2026-07-05T08:02:34.227055+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXFRLWWVVUGR","created_at":"2026-07-05T08:02:34.227055+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXFRLWWVVUGRIZRS","created_at":"2026-07-05T08:02:34.227055+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXFRLWWV","created_at":"2026-07-05T08:02:34.227055+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23997","citing_title":"ChartWalker: Benchmarking the Cross-Chart RAG Task with Hierarchical Knowledge Graphs","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2506.07180","citing_title":"Flattery in Motion: Benchmarking and Analyzing Sycophancy in Video-LLMs","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2501.00309","citing_title":"Retrieval-Augmented Generation with Graphs (GraphRAG)","ref_index":59,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DXFRLWWVVUGRIZRSJDJL22EBEO","json":"https://pith.science/pith/DXFRLWWVVUGRIZRSJDJL22EBEO.json","graph_json":"https://pith.science/api/pith-number/DXFRLWWVVUGRIZRSJDJL22EBEO/graph.json","events_json":"https://pith.science/api/pith-number/DXFRLWWVVUGRIZRSJDJL22EBEO/events.json","paper":"https://pith.science/paper/DXFRLWWV"},"agent_actions":{"view_html":"https://pith.science/pith/DXFRLWWVVUGRIZRSJDJL22EBEO","download_json":"https://pith.science/pith/DXFRLWWVVUGRIZRSJDJL22EBEO.json","view_paper":"https://pith.science/paper/DXFRLWWV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.00492&json=true","fetch_graph":"https://pith.science/api/pith-number/DXFRLWWVVUGRIZRSJDJL22EBEO/graph.json","fetch_events":"https://pith.science/api/pith-number/DXFRLWWVVUGRIZRSJDJL22EBEO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXFRLWWVVUGRIZRSJDJL22EBEO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXFRLWWVVUGRIZRSJDJL22EBEO/action/storage_attestation","attest_author":"https://pith.science/pith/DXFRLWWVVUGRIZRSJDJL22EBEO/action/author_attestation","sign_citation":"https://pith.science/pith/DXFRLWWVVUGRIZRSJDJL22EBEO/action/citation_signature","submit_replication":"https://pith.science/pith/DXFRLWWVVUGRIZRSJDJL22EBEO/action/replication_record"}},"created_at":"2026-07-05T08:02:34.227055+00:00","updated_at":"2026-07-05T08:02:34.227055+00:00"}