{"as_of":"2026-08-09T23:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4501ff0f22ce5e7698daba8285592d1e62003b2ca2e60753585f691d7dbdd21b","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T00:56:44.480631Z","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-05T12:26:57.153266Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.10043","last_updated":"2020-07-15T11:58:45Z","snapshot_observed_at":"2026-08-09T13:49:31.425757Z","submitted_at":"2020-02-24T02:33:01Z","title":"Complete Dictionary Learning via $\\ell_p$-norm Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.10043","snapshot_observed_at":"2026-08-07T11:23:42.957257Z","title":"In: Proceedings 2002 IEEE Symposium on Security and Privacy","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.02660","last_updated":"2025-06-03T09:12:43Z","snapshot_observed_at":"2026-08-09T13:48:57.801709Z","submitted_at":"2025-06-03T09:12:43Z","title":"Tarallo: Evading Behavioral Malware Detectors in the Problem Space","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T11:23:42.957257Z"},"links":{"cited_paper":"/paper/2002.10043","citing_paper":"/paper/2506.02660"},"observation_digest":"sha256:6d4ab3f6824af761fd5bc4019108b3a250834643e1798f121af5342dcb997f0a","observation_id":"376d7d97-560a-4a64-858d-507d92159162","resolution":{"observed_at":"2026-08-07T11:23:42.957257Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10043","last_updated":"2020-07-15T11:58:45Z","snapshot_observed_at":"2026-08-09T13:49:31.425757Z","submitted_at":"2020-02-24T02:33:01Z","title":"Complete Dictionary Learning via $\\ell_p$-norm Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.10043","snapshot_observed_at":"2026-08-01T00:58:04.850079Z","title":"In: Proc","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.25995","last_updated":"2026-07-28T17:12:12Z","snapshot_observed_at":"2026-08-09T13:49:47.557688Z","submitted_at":"2026-07-28T17:12:12Z","title":"Does Runtime Topology Context Improve LLM-Generated Kubernetes Security Patches?","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T00:58:04.850079Z"},"links":{"cited_paper":"/paper/2002.10043","citing_paper":"/paper/2607.25995"},"observation_digest":"sha256:1bb5d577a1370fe0365a9d732823faa8fb4ede654b3469fa99e9a437aa951154","observation_id":"5c789ab3-e90d-41bf-8867-bd098b610b21","resolution":{"observed_at":"2026-08-01T00:58:04.850079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10043","last_updated":"2020-07-15T11:58:45Z","snapshot_observed_at":"2026-08-09T13:49:31.425757Z","submitted_at":"2020-02-24T02:33:01Z","title":"Complete Dictionary Learning via $\\ell_p$-norm Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.10043","snapshot_observed_at":"2026-07-31T10:22:09.071743Z","title":"CCC , pages =","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.071743Z"},"links":{"cited_paper":"/paper/2002.10043","citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:02f61fd768d15fbe7a289f07f3c20be80f14cb3732aeca54d3b3a83b6151277b","observation_id":"0222fb42-7bad-4448-89f9-cd184ec6b5f4","resolution":{"observed_at":"2026-07-31T10:22:09.071743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10043","last_updated":"2020-07-15T11:58:45Z","snapshot_observed_at":"2026-08-09T13:49:31.425757Z","submitted_at":"2020-02-24T02:33:01Z","title":"Complete Dictionary Learning via $\\ell_p$-norm Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.10043","snapshot_observed_at":"2026-08-08T00:56:44.480631Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.03110","last_updated":"2026-08-04T04:30:18Z","snapshot_observed_at":"2026-08-09T13:49:12.048162Z","submitted_at":"2026-08-04T04:30:18Z","title":"PECR: A Reproducible Specification and Synthetic Stress Test of Telemetry-Informed Vulnerability Prioritization for SD-WAN","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T00:56:44.480631Z"},"links":{"cited_paper":"/paper/2002.10043","citing_paper":"/paper/2608.03110"},"observation_digest":"sha256:e23fe9921ba15f73c44c43658eee41e659fff9f7c0bb6c1a07f1758a7d411ab7","observation_id":"7e0a998c-d7b5-404e-85f3-fe42069a0791","resolution":{"observed_at":"2026-08-08T00:56:44.480631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10043","last_updated":"2020-07-15T11:58:45Z","snapshot_observed_at":"2026-08-09T13:49:31.425757Z","submitted_at":"2020-02-24T02:33:01Z","title":"Complete Dictionary Learning via $\\ell_p$-norm Maximization","version":3},"cited_work":{"arxiv_id":"2002.10043","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.10043","snapshot_observed_at":"2026-08-05T12:26:57.153266Z","title":"Complete Dictionary Learning via $\\ell_p$-norm Maximization","venue":"cs.LG","work_id":"f188f0df-7a0b-4f67-8ee8-972575f66dd6","year":2020},"citing_paper":{"arxiv_id":"2608.03801","last_updated":"2026-08-04T15:15:02Z","snapshot_observed_at":"2026-08-09T13:49:28.813881Z","submitted_at":"2026-08-04T15:15:02Z","title":"Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension","version":1},"reference_index":101,"source":"arxiv_source","source_observed_at":"2026-08-05T12:26:55.870057Z"},"links":{"cited_paper":"/paper/2002.10043","citing_paper":"/paper/2608.03801"},"observation_digest":"sha256:3057510bdf9dd8c43c7c27a3b30336b0b4b52fb17efffd7468e3862687d374ff","observation_id":"3af14cb3-30b9-4287-b78d-eacfe96b11af","resolution":{"observed_at":"2026-08-05T12:26:57.158199Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10043","last_updated":"2020-07-15T11:58:45Z","snapshot_observed_at":"2026-08-09T13:49:31.425757Z","submitted_at":"2020-02-24T02:33:01Z","title":"Complete Dictionary Learning via $\\ell_p$-norm Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.10043","snapshot_observed_at":"2026-08-07T21:46:23.078142Z","title":"Haines, Somesh Jha, Richard P","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.05884","last_updated":"2026-08-06T11:06:06Z","snapshot_observed_at":"2026-08-09T23:11:46.910186Z","submitted_at":"2026-08-06T11:06:06Z","title":"The Vulnerability With No CVE: Managing Persistent Gaps Between Mandate and Authority in AI Coding Agents","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T21:46:23.078142Z"},"links":{"cited_paper":"/paper/2002.10043","citing_paper":"/paper/2608.05884"},"observation_digest":"sha256:e594f53c52cc799d7927212ac36e8c9f33d15f8bef724f87acb4e20ecc042049","observation_id":"42e2e241-18c1-4abd-a900-e0060a5efa35","resolution":{"observed_at":"2026-08-07T21:46:23.078142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2002.10043/citation-record","integrity":"/paper/2002.10043/integrity","json":"/paper/2002.10043/citation-record.json","paper":"/paper/2002.10043"},"outbound":[],"paper":{"arxiv_id":"2002.10043","last_updated":"2020-07-15T11:58:45Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T13:49:31.425757Z","submitted_at":"2020-02-24T02:33:01Z","title":"Complete Dictionary Learning via $\\ell_p$-norm Maximization"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2002.10043."}