{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OSTYYOMRHXY3TW4MVIJ3IVDKYH","short_pith_number":"pith:OSTYYOMR","schema_version":"1.0","canonical_sha256":"74a78c39913df1b9db8caa13b4546ac1e263766898c3e24a1b481d80e3e2ac65","source":{"kind":"arxiv","id":"2405.15452","version":2},"attestation_state":"computed","paper":{"title":"Leveraging Logical Rules in Knowledge Editing: A Cherry on the Top","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, Ke Xu, Keyuan Cheng, Lijie Hu, Lu Yu, Muhammad Asif Ali, Shu Yang, Yuxuan zhai","submitted_at":"2024-05-24T11:30:00Z","abstract_excerpt":"Multi-hop Question Answering (MQA) under knowledge editing (KE) is a key challenge in Large Language Models (LLMs). While best-performing solutions in this domain use a plan and solve paradigm to split a question into sub-questions followed by response generation, we claim that this approach is sub-optimal as it fails for hard to decompose questions, and it does not explicitly cater to correlated knowledge updates resulting as a consequence of knowledge edits. This has a detrimental impact on the overall consistency of the updated knowledge. To address these issues, in this paper, we propose a"},"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":"2405.15452","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-05-24T11:30:00Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"ae1aa41ec39aae9be49676937fd2ae3179357033d02e05fa663407c3b0c7c606","abstract_canon_sha256":"35d0a83ca6e86015c2fb40c0c72b0ac9a39eb35dc7eae4f33dca5f21d9dc85d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:23:24.585441Z","signature_b64":"MFBYRp03CGFMeSqvxZ79iojRnfmCmbnKGYjxXbaIRWAXY2R5SNm+zom+bbCeMEVWj4VBYr7a/0NZuETBcBOhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74a78c39913df1b9db8caa13b4546ac1e263766898c3e24a1b481d80e3e2ac65","last_reissued_at":"2026-07-05T08:23:24.584960Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:23:24.584960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Leveraging Logical Rules in Knowledge Editing: A Cherry on the Top","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, Ke Xu, Keyuan Cheng, Lijie Hu, Lu Yu, Muhammad Asif Ali, Shu Yang, Yuxuan zhai","submitted_at":"2024-05-24T11:30:00Z","abstract_excerpt":"Multi-hop Question Answering (MQA) under knowledge editing (KE) is a key challenge in Large Language Models (LLMs). While best-performing solutions in this domain use a plan and solve paradigm to split a question into sub-questions followed by response generation, we claim that this approach is sub-optimal as it fails for hard to decompose questions, and it does not explicitly cater to correlated knowledge updates resulting as a consequence of knowledge edits. This has a detrimental impact on the overall consistency of the updated knowledge. To address these issues, in this paper, we propose a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.15452","kind":"arxiv","version":2},"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/2405.15452/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":"2405.15452","created_at":"2026-07-05T08:23:24.585017+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.15452v2","created_at":"2026-07-05T08:23:24.585017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.15452","created_at":"2026-07-05T08:23:24.585017+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSTYYOMRHXY3","created_at":"2026-07-05T08:23:24.585017+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSTYYOMRHXY3TW4M","created_at":"2026-07-05T08:23:24.585017+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSTYYOMR","created_at":"2026-07-05T08:23:24.585017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10554","citing_title":"Benchmarking Knowledge Editing using Logical Rules","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2506.07180","citing_title":"Flattery in Motion: Benchmarking and Analyzing Sycophancy in Video-LLMs","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OSTYYOMRHXY3TW4MVIJ3IVDKYH","json":"https://pith.science/pith/OSTYYOMRHXY3TW4MVIJ3IVDKYH.json","graph_json":"https://pith.science/api/pith-number/OSTYYOMRHXY3TW4MVIJ3IVDKYH/graph.json","events_json":"https://pith.science/api/pith-number/OSTYYOMRHXY3TW4MVIJ3IVDKYH/events.json","paper":"https://pith.science/paper/OSTYYOMR"},"agent_actions":{"view_html":"https://pith.science/pith/OSTYYOMRHXY3TW4MVIJ3IVDKYH","download_json":"https://pith.science/pith/OSTYYOMRHXY3TW4MVIJ3IVDKYH.json","view_paper":"https://pith.science/paper/OSTYYOMR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.15452&json=true","fetch_graph":"https://pith.science/api/pith-number/OSTYYOMRHXY3TW4MVIJ3IVDKYH/graph.json","fetch_events":"https://pith.science/api/pith-number/OSTYYOMRHXY3TW4MVIJ3IVDKYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSTYYOMRHXY3TW4MVIJ3IVDKYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSTYYOMRHXY3TW4MVIJ3IVDKYH/action/storage_attestation","attest_author":"https://pith.science/pith/OSTYYOMRHXY3TW4MVIJ3IVDKYH/action/author_attestation","sign_citation":"https://pith.science/pith/OSTYYOMRHXY3TW4MVIJ3IVDKYH/action/citation_signature","submit_replication":"https://pith.science/pith/OSTYYOMRHXY3TW4MVIJ3IVDKYH/action/replication_record"}},"created_at":"2026-07-05T08:23:24.585017+00:00","updated_at":"2026-07-05T08:23:24.585017+00:00"}