{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DETY2BUHSRK44TW33UWSHOYGR4","short_pith_number":"pith:DETY2BUH","schema_version":"1.0","canonical_sha256":"19278d06879455ce4edbdd2d23bb068f280dc7d3c965ae0de870cada1451555c","source":{"kind":"arxiv","id":"2403.14236","version":5},"attestation_state":"computed","paper":{"title":"A Unified Framework for Model Editing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Akshat Gupta, Dev Sajnani, Gopala Anumanchipalli","submitted_at":"2024-03-21T08:54:24Z","abstract_excerpt":"ROME and MEMIT are largely believed to be two different model editing algorithms, with the major difference between them being the ability to perform batched edits. In this paper, we unify these two algorithms under a single conceptual umbrella, optimizing for the same goal, which we call the preservation-memorization objective. ROME uses an equality constraint to optimize this objective to perform one edit at a time, whereas MEMIT employs a more flexible least-square constraint that allows for batched edits. We generalize ROME and enable batched editing with equality constraint in the form of"},"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":"2403.14236","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-21T08:54:24Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"b58bb5bee334cf8f5995381ddd21780ed8e3761a93ba5403285dd0ce80e990ca","abstract_canon_sha256":"3e2e65fa75168cee0c8ed1b55606414b485b6fd208b77cf585fbe11cb68689b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:17:38.916923Z","signature_b64":"dKu94G3ozxFMWFO/nBLABTZrXG9gKKoMylMKtFkFc0HpIrgGH2y6an4eb3sJ1c6xfCBpjev1hUWXLgPeChDkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19278d06879455ce4edbdd2d23bb068f280dc7d3c965ae0de870cada1451555c","last_reissued_at":"2026-07-05T09:17:38.916364Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:17:38.916364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Framework for Model Editing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Akshat Gupta, Dev Sajnani, Gopala Anumanchipalli","submitted_at":"2024-03-21T08:54:24Z","abstract_excerpt":"ROME and MEMIT are largely believed to be two different model editing algorithms, with the major difference between them being the ability to perform batched edits. In this paper, we unify these two algorithms under a single conceptual umbrella, optimizing for the same goal, which we call the preservation-memorization objective. ROME uses an equality constraint to optimize this objective to perform one edit at a time, whereas MEMIT employs a more flexible least-square constraint that allows for batched edits. We generalize ROME and enable batched editing with equality constraint in the form of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.14236","kind":"arxiv","version":5},"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/2403.14236/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":"2403.14236","created_at":"2026-07-05T09:17:38.916423+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.14236v5","created_at":"2026-07-05T09:17:38.916423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.14236","created_at":"2026-07-05T09:17:38.916423+00:00"},{"alias_kind":"pith_short_12","alias_value":"DETY2BUHSRK4","created_at":"2026-07-05T09:17:38.916423+00:00"},{"alias_kind":"pith_short_16","alias_value":"DETY2BUHSRK44TW3","created_at":"2026-07-05T09:17:38.916423+00:00"},{"alias_kind":"pith_short_8","alias_value":"DETY2BUH","created_at":"2026-07-05T09:17:38.916423+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.17057","citing_title":"Correct When Paired, Wrong When Split: Decoupling and Editing Modality-Specific Neurons in MLLMs","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2606.03924","citing_title":"Knowledge Editing in Masked Diffusion Language Models","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2511.03182","citing_title":"Understanding Robustness of Model Editing in Code LLMs","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2603.19297","citing_title":"CLaRE-ty Amid Chaos: Quantifying Representational Entanglement to Predict Ripple Effects in LLM Editing","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DETY2BUHSRK44TW33UWSHOYGR4","json":"https://pith.science/pith/DETY2BUHSRK44TW33UWSHOYGR4.json","graph_json":"https://pith.science/api/pith-number/DETY2BUHSRK44TW33UWSHOYGR4/graph.json","events_json":"https://pith.science/api/pith-number/DETY2BUHSRK44TW33UWSHOYGR4/events.json","paper":"https://pith.science/paper/DETY2BUH"},"agent_actions":{"view_html":"https://pith.science/pith/DETY2BUHSRK44TW33UWSHOYGR4","download_json":"https://pith.science/pith/DETY2BUHSRK44TW33UWSHOYGR4.json","view_paper":"https://pith.science/paper/DETY2BUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.14236&json=true","fetch_graph":"https://pith.science/api/pith-number/DETY2BUHSRK44TW33UWSHOYGR4/graph.json","fetch_events":"https://pith.science/api/pith-number/DETY2BUHSRK44TW33UWSHOYGR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DETY2BUHSRK44TW33UWSHOYGR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DETY2BUHSRK44TW33UWSHOYGR4/action/storage_attestation","attest_author":"https://pith.science/pith/DETY2BUHSRK44TW33UWSHOYGR4/action/author_attestation","sign_citation":"https://pith.science/pith/DETY2BUHSRK44TW33UWSHOYGR4/action/citation_signature","submit_replication":"https://pith.science/pith/DETY2BUHSRK44TW33UWSHOYGR4/action/replication_record"}},"created_at":"2026-07-05T09:17:38.916423+00:00","updated_at":"2026-07-05T09:17:38.916423+00:00"}