{"as_of":"2026-08-06T21:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ac27a88e0872b4a0c3b2970be13c3a7324b239fb372829181511013f4c2db0fc","coverage":[{"denominator":1,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T18:48:17.036514Z","state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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-18T10:44:53.516653Z","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-18T10:46:17.045393Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.14013","last_updated":"2025-08-19T17:22:50Z","snapshot_observed_at":"2026-08-05T18:48:14.577906Z","submitted_at":"2025-08-19T17:22:50Z","title":"Efficient Knowledge Graph Unlearning with Zeroth-order Information","version":1},"cited_work":{"arxiv_id":"2508.14013","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.14013","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Towards memory-efficient and sus- tainable machine unlearning on edge using zeroth-order optimizer","venue":null,"work_id":"0394a5fe-6674-453d-8dc3-ae1ae1500736","year":2025},"citing_paper":{"arxiv_id":"2510.00761","last_updated":"2026-04-18T07:30:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T10:50:14Z","title":"Downgrade to Upgrade: Optimizer Simplification Enhances Robustness in LLM Unlearning","version":5},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-18T10:44:53.516653Z"},"links":{"cited_paper":"/paper/2508.14013","citing_paper":"/paper/2510.00761"},"observation_digest":"sha256:ecbd8425e742cba008b09091be3266a5ad40e3ab6fb93131a23f7169b5427ada","observation_id":"1410a98f-789a-4980-9099-6c7ae1c0dd32","resolution":{"observed_at":"2026-05-18T10:46:17.048300Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.14013/citation-record","integrity":"/paper/2508.14013/integrity","json":"/paper/2508.14013/citation-record.json","paper":"/paper/2508.14013"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2508.14010","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:48:17.182738Z","title":null,"venue":null,"work_id":"95c308be-e13f-4e4c-a609-17efc5c54d73","year":2026},"citing_paper":{"arxiv_id":"2508.14013","last_updated":"2025-08-19T17:22:50Z","snapshot_observed_at":"2026-08-05T18:48:14.577906Z","submitted_at":"2025-08-19T17:22:50Z","title":"Efficient Knowledge Graph Unlearning with Zeroth-order Information","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T18:48:17.036514Z"},"links":{"citing_paper":"/paper/2508.14013"},"observation_digest":"sha256:718d5e7abcbfa63d109aa28f13dc91de94447e273e17374c9ba68cd59889a1e6","observation_id":"04f15ec7-4cf5-4f79-a8e2-317def27a2c4","resolution":{"observed_at":"2026-08-05T18:48:17.236248Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.14013","last_updated":"2025-08-19T17:22:50Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T18:48:14.577906Z","submitted_at":"2025-08-19T17:22:50Z","title":"Efficient Knowledge Graph Unlearning with Zeroth-order Information"},"reference_resolution":{"displayed":1,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":1},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 1 of 1 outbound references and 1 inbound Pith citation observation for arXiv:2508.14013."}