{"as_of":"2026-08-09T01:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f20c25dd3e7927bf4614a8aa8bbbd611001001ef9ffbaabbd7ef9c316991b712","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:50:53.625888Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-12T04:36:30.789641Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T06:06:25.849117Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"cited_work":{"arxiv_id":"2506.04226","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.04226","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient knowl- edge editing via minimal precomputation.arXiv preprint arXiv:2506.04226","venue":null,"work_id":"f30e5051-7d8b-4b55-82f4-f4492d038b63","year":2025},"citing_paper":{"arxiv_id":"2605.09285","last_updated":"2026-05-10T03:17:57Z","snapshot_observed_at":"2026-07-06T23:21:26.017420Z","submitted_at":"2026-05-10T03:17:57Z","title":"BetaEdit: Null-Space Constrained Sequential Model Editing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-12T04:36:30.789641Z"},"links":{"cited_paper":"/paper/2506.04226","citing_paper":"/paper/2605.09285"},"observation_digest":"sha256:7693e2512aea66a876fa8859c64c54255ceb8ee765cb4fcc7861e745b3533281","observation_id":"32b5a8e1-4f72-486f-8b8e-77775a8a409b","resolution":{"observed_at":"2026-05-12T06:06:25.852157Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.04226/citation-record","integrity":"/paper/2506.04226/integrity","json":"/paper/2506.04226/citation-record.json","paper":"/paper/2506.04226"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2307.12976","last_updated":"2023-12-20T11:52:41Z","snapshot_observed_at":"2026-08-05T09:43:41.386728Z","submitted_at":"2023-07-24T17:52:46Z","title":"Evaluating the Ripple Effects of Knowledge Editing in Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.12976","snapshot_observed_at":"2026-08-07T10:50:52.935749Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:52.935749Z"},"links":{"cited_paper":"/paper/2307.12976","citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:0a29e974374da2bf9f14b2e84c34a5e0ee429712ea54397ba0d797d83097dd12","observation_id":"6dbc2801-1558-4fa2-8a3a-e6939520222b","resolution":{"observed_at":"2026-08-07T10:50:52.935749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02355","last_updated":"2025-04-22T16:15:47Z","snapshot_observed_at":"2026-08-08T23:26:11.950951Z","submitted_at":"2024-10-03T10:06:27Z","title":"AlphaEdit: Null-Space Constrained Knowledge Editing for Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02355","snapshot_observed_at":"2026-08-07T10:50:53.049082Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.049082Z"},"links":{"cited_paper":"/paper/2410.02355","citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:d53370ae60247b27fd0e04832b18304bccc57bd5456abfa231917bcf168b1b1d","observation_id":"c0afa74f-c437-4f6f-9ee9-f6da03669e66","resolution":{"observed_at":"2026-08-07T10:50:53.049082Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07175","last_updated":"2024-10-09T03:41:43Z","snapshot_observed_at":"2026-08-08T14:54:34.099407Z","submitted_at":"2024-03-11T21:33:05Z","title":"Rebuilding ROME : Resolving Model Collapse during Sequential Model Editing","version":3},"cited_work":{"arxiv_id":"2403.07175","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.07175","snapshot_observed_at":"2026-08-07T10:50:53.824271Z","title":"Rebuilding ROME : Resolving Model Collapse during Sequential Model Editing","venue":"cs.CL","work_id":"7689bafd-0035-416a-951d-16e1ed956c30","year":2024},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.186569Z"},"links":{"cited_paper":"/paper/2403.07175","citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:d3243bb3b9089e67ba282737c738f675adae57a25e0db77d42cd1ff84fd04881","observation_id":"a82fa860-9a16-4820-bc8b-f4c3d278b469","resolution":{"observed_at":"2026-08-07T10:50:53.831122Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.01636","last_updated":"2025-05-21T17:58:23Z","snapshot_observed_at":"2026-07-06T20:30:26.881629Z","submitted_at":"2025-02-03T18:59:14Z","title":"Lifelong Knowledge Editing requires Better Regularization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.01636","snapshot_observed_at":"2026-08-07T10:50:53.345156Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.345156Z"},"links":{"cited_paper":"/paper/2502.01636","citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:e2aa96c2fe5e22346aa8a59c7747f241ba1b8d261cb5c7a9486d08003210438d","observation_id":"28bff15b-602c-4afc-b3f5-9264a5168727","resolution":{"observed_at":"2026-08-07T10:50:53.345156Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.07453","last_updated":"2024-06-10T17:50:14Z","snapshot_observed_at":"2026-08-06T16:18:25.129284Z","submitted_at":"2024-01-15T03:57:15Z","title":"Model Editing at Scale leads to Gradual and Catastrophic Forgetting","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.07453","snapshot_observed_at":"2026-08-07T10:50:53.504135Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.504135Z"},"links":{"cited_paper":"/paper/2401.07453","citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:76c3a533995d3a87a7e0ce790040afff8e33d214f9bc2b913f36bbea89b4d5db","observation_id":"3abb9738-5963-4f4b-b278-3766599b4ce8","resolution":{"observed_at":"2026-08-07T10:50:53.504135Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.14236","last_updated":"2024-10-09T03:37:30Z","snapshot_observed_at":"2026-08-05T03:37:19.701835Z","submitted_at":"2024-03-21T08:54:24Z","title":"A Unified Framework for Model Editing","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.14236","snapshot_observed_at":"2026-08-07T10:50:53.538851Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.538851Z"},"links":{"cited_paper":"/paper/2403.14236","citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:bea0dfa9fbc4e9ff4db1dbeaa17dc30c05dc35faebb6357e1ecea41129fad099","observation_id":"80d155c6-3b96-43fb-812c-fc6b6c6b181e","resolution":{"observed_at":"2026-08-07T10:50:53.538851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:50:53.544176Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.544176Z"},"links":{"citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:b859dd41885a174f1354c24b6863c86d16d0476c48917cbc608317a88ecf5f87","observation_id":"beeaec79-5f59-432c-afea-9441a07b1731","resolution":{"observed_at":"2026-08-07T10:50:53.544176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.08742","last_updated":"2024-03-11T11:35:48Z","snapshot_observed_at":"2026-07-06T16:07:06.809394Z","submitted_at":"2023-08-17T02:33:43Z","title":"PMET: Precise Model Editing in a Transformer","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.08742","snapshot_observed_at":"2026-08-07T10:50:53.549060Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.549060Z"},"links":{"cited_paper":"/paper/2308.08742","citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:a0e2412bb90c54769df8b52cd450045abab2442cdb5835c204a5545a4140ab64","observation_id":"638f8657-ad2e-4903-850c-2abae05de920","resolution":{"observed_at":"2026-08-07T10:50:53.549060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16821","last_updated":"2025-03-03T04:25:41Z","snapshot_observed_at":"2026-08-04T14:38:18.387605Z","submitted_at":"2024-05-27T04:40:56Z","title":"Perturbation-Restrained Sequential Model Editing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16821","snapshot_observed_at":"2026-08-07T10:50:53.554103Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.554103Z"},"links":{"cited_paper":"/paper/2405.16821","citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:b9813fa8b0c4817723828508ac36a223254292669b4c6df777f77407ea62c00a","observation_id":"96c6e854-237d-47bd-8628-56e50c90f0db","resolution":{"observed_at":"2026-08-07T10:50:53.554103Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:50:53.559389Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.559389Z"},"links":{"citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:63b2482cb51df855d8aedca638c5d7bd03c568e8e3a3d293c5600cac19615340","observation_id":"df8cd2e8-e71e-4a8d-bcc8-00e433cb802c","resolution":{"observed_at":"2026-08-07T10:50:53.559389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.07229","last_updated":"2023-08-01T18:41:52Z","snapshot_observed_at":"2026-07-06T14:04:55.099373Z","submitted_at":"2022-10-13T17:55:53Z","title":"Mass-Editing Memory in a Transformer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.07229","snapshot_observed_at":"2026-08-07T10:50:53.577756Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.577756Z"},"links":{"cited_paper":"/paper/2210.07229","citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:f684fa0c9cda41f14d9a57b5b36186a453172abffc623cbb7a6a0265f32ba520","observation_id":"a22caa30-8430-4132-8b93-40919e60839c","resolution":{"observed_at":"2026-08-07T10:50:53.577756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:50:53.582615Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.582615Z"},"links":{"citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:63ba06ad29c01110edcec389036699fa038fabd8a534fda1e464b9b97f2faa00","observation_id":"4b6d1b57-6c9a-43db-9b05-1fc9fd51c7f7","resolution":{"observed_at":"2026-08-07T10:50:53.582615Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:50:53.587333Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.587333Z"},"links":{"citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:45ea7a595ba0d888dd6319155c4299c732a206c221566f1833fba5a9d3656367","observation_id":"7a61a5dc-4376-424a-a5f8-0b4068a3b75d","resolution":{"observed_at":"2026-08-07T10:50:53.587333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-07T10:50:53.591447Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.591447Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:e7962eba11ef1b41da05fccb8f2dc61713efa7dd033ab3af6e2946390fd86d30","observation_id":"20d1be11-13cb-4866-b643-f602776437bc","resolution":{"observed_at":"2026-08-07T10:50:53.591447Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:50:53.596939Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.596939Z"},"links":{"citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:34632be3761dfef75f2ca9830c09feba3ca16e40a227f55eb8e71d923ef0f9ff","observation_id":"add24bd7-3b37-42ca-bb6f-bcf01130c429","resolution":{"observed_at":"2026-08-07T10:50:53.596939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.13172","last_updated":"2023-11-30T08:55:24Z","snapshot_observed_at":"2026-07-06T15:30:45.921201Z","submitted_at":"2023-05-22T16:00:00Z","title":"Editing Large Language Models: Problems, Methods, and Opportunities","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.13172","snapshot_observed_at":"2026-08-07T10:50:53.602362Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.602362Z"},"links":{"cited_paper":"/paper/2305.13172","citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:a9cd0adef075c8ac25086819a09f1a14c80d3e70fe5993ec6a20fd33ba754ddd","observation_id":"c90fe871-914b-4bd9-a68b-c89be149e398","resolution":{"observed_at":"2026-08-07T10:50:53.602362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.00664","last_updated":"2024-05-01T17:50:37Z","snapshot_observed_at":"2026-07-06T18:08:17.557905Z","submitted_at":"2024-05-01T17:50:37Z","title":"Is Bigger Edit Batch Size Always Better? -- An Empirical Study on Model Editing with Llama-3","version":1},"cited_work":{"arxiv_id":"2405.00664","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.00664","snapshot_observed_at":"2026-08-07T10:50:53.677167Z","title":"Is Bigger Edit Batch Size Always Better? -- An Empirical Study on Model Editing with Llama-3","venue":"cs.CL","work_id":"75e2a471-2906-4c05-a922-6a33e449dcf7","year":2024},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.607632Z"},"links":{"cited_paper":"/paper/2405.00664","citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:cd9d543a94aa0ab7afc3a2237373d026fc5ba9ce7bdc7418a624b0dce48bd94f","observation_id":"73069d6e-5a0a-4bfd-a572-3b1eeaacb1f3","resolution":{"observed_at":"2026-08-07T10:50:53.685852Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14795","last_updated":"2024-09-09T04:38:16Z","snapshot_observed_at":"2026-08-08T03:53:12.760640Z","submitted_at":"2023-05-24T06:48:41Z","title":"MQuAKE: Assessing Knowledge Editing in Language Models via Multi-Hop Questions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14795","snapshot_observed_at":"2026-08-07T10:50:53.613097Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.613097Z"},"links":{"cited_paper":"/paper/2305.14795","citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:d87153e37104629a637811f64534b6e92b62ef8eaee45fb8148e4a6afdc89f29","observation_id":"c664a942-c933-46bb-81dd-7b0f0bd75280","resolution":{"observed_at":"2026-08-07T10:50:53.613097Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:50:53.619773Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.619773Z"},"links":{"citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:b3d2ab555467a0f698fd036667fd5d925d5000db83628f8484c47d1c1f1df9a5","observation_id":"ebea2c4f-e06a-4d53-87fa-b2be7f5c3b4d","resolution":{"observed_at":"2026-08-07T10:50:53.619773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:50:53.625888Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T10:50:53.625888Z"},"links":{"citing_paper":"/paper/2506.04226"},"observation_digest":"sha256:c5c20ba63d94daf759ad23064edaab45ab9374084fcb38b5e91d599b6ce3328e","observation_id":"af4b9b22-0390-4dc4-bb99-5215e276a271","resolution":{"observed_at":"2026-08-07T10:50:53.625888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.04226","last_updated":"2025-06-04T17:59:05Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-08T04:33:00.485362Z","submitted_at":"2025-06-04T17:59:05Z","title":"Efficient Knowledge Editing via Minimal Precomputation"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":20},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 1 inbound Pith citation observation for arXiv:2506.04226."}