{"as_of":"2026-08-15T10:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c744f1737fa4ccae33e5622b4b70459547b36f2341971f233addc55b1bed0f75","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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-15T06:32:42.880941+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T01:03:35.783781Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T11:30:05.761057Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2003.04247","last_updated":"2020-12-01T16:01:10Z","snapshot_observed_at":"2026-08-06T06:26:57.210854Z","submitted_at":"2020-03-09T16:39:46Z","title":"Towards Probabilistic Verification of Machine Unlearning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.04247","snapshot_observed_at":"2026-08-11T01:03:35.783781Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.19069","last_updated":"2024-12-26T05:53:10Z","snapshot_observed_at":"2026-08-15T00:24:38.905356Z","submitted_at":"2024-12-26T05:53:10Z","title":"Effective and secure federated online learning to rank","version":1},"reference_index":136,"source":"pdf_text","source_observed_at":"2026-08-11T01:03:35.783781Z"},"links":{"cited_paper":"/paper/2003.04247","citing_paper":"/paper/2412.19069"},"observation_digest":"sha256:23d00ac313a874fbbbe09fe3dbe445192786d1340cef0c22aaeb4cb1394dcb47","observation_id":"7ac0e290-f1c2-4332-9017-12ae18acda51","resolution":{"observed_at":"2026-08-11T01:03:35.783781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.04247","last_updated":"2020-12-01T16:01:10Z","snapshot_observed_at":"2026-08-06T06:26:57.210854Z","submitted_at":"2020-03-09T16:39:46Z","title":"Towards Probabilistic Verification of Machine Unlearning","version":2},"cited_work":{"arxiv_id":"2003.04247","doi":null,"metadata_source":"pith","pith_arxiv_id":"2003.04247","snapshot_observed_at":"2026-08-07T11:30:05.761057Z","title":"Towards Probabilistic Verification of Machine Unlearning","venue":"cs.CR","work_id":"1446ace2-594a-497f-8135-d77770d47920","year":2020},"citing_paper":{"arxiv_id":"2506.02230","last_updated":"2025-06-02T20:14:22Z","snapshot_observed_at":"2026-08-11T04:18:57.222022Z","submitted_at":"2025-06-02T20:14:22Z","title":"Towards Machine Unlearning for Paralinguistic Speech Processing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:30:04.033587Z"},"links":{"cited_paper":"/paper/2003.04247","citing_paper":"/paper/2506.02230"},"observation_digest":"sha256:ea93a72619e623c21af661619a2235fb5e001101d19d06726ec33154de0b3eee","observation_id":"5918827e-d6e7-43d8-a934-ec51a9eb0019","resolution":{"observed_at":"2026-08-07T11:30:05.839306Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2003.04247/citation-record","integrity":"/paper/2003.04247/integrity","json":"/paper/2003.04247/citation-record.json","paper":"/paper/2003.04247"},"outbound":[],"paper":{"arxiv_id":"2003.04247","last_updated":"2020-12-01T16:01:10Z","latest_version":2,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-06T06:26:57.210854Z","submitted_at":"2020-03-09T16:39:46Z","title":"Towards Probabilistic Verification of Machine Unlearning"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2003.04247."}