{"as_of":"2026-08-10T22:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e5d44c9655d02b0628646c561ec61995fd24b9b55953ef258634e45e0a0ec387","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-10T06:31:04.303077+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-08T19:47:23.128486Z","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-08T19:47:24.513100Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2005.08540","last_updated":"2020-05-18T09:06:29Z","snapshot_observed_at":"2026-08-06T17:11:10.648548Z","submitted_at":"2020-05-18T09:06:29Z","title":"Approximate Denial Constraints","version":1},"cited_work":{"arxiv_id":"2005.08540","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.08540","snapshot_observed_at":"2026-08-08T19:47:24.513100Z","title":"Approximate Denial Constraints","venue":"cs.DB","work_id":"529a99ff-7daf-4f88-9bf2-2bdd8a6b7f2d","year":2020},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.128486Z"},"links":{"cited_paper":"/paper/2005.08540","citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:421dab91fbb51e88c01cf5bdd97100d68aa6f15db643968fed5fac288c755651","observation_id":"26da4190-ed51-4ee1-87d4-6a404cb65b40","resolution":{"observed_at":"2026-08-08T19:47:24.517798Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08540","last_updated":"2020-05-18T09:06:29Z","snapshot_observed_at":"2026-08-06T17:11:10.648548Z","submitted_at":"2020-05-18T09:06:29Z","title":"Approximate Denial Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.08540","snapshot_observed_at":"2026-07-31T23:22:59.929958Z","title":"Approximate denial constraints,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.24021","last_updated":"2026-07-27T05:35:57Z","snapshot_observed_at":"2026-08-04T15:39:16.581730Z","submitted_at":"2026-07-27T05:35:57Z","title":"EviDC: A Violation-Guided Algorithm for Incremental Denial Constraint Discovery","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-31T23:22:59.929958Z"},"links":{"cited_paper":"/paper/2005.08540","citing_paper":"/paper/2607.24021"},"observation_digest":"sha256:db7fd984cee0381f566df0f0b0dff667491cb5ca4c628af46847001287376cbf","observation_id":"fe63877e-97ef-44ec-aa7d-a347f99b8c09","resolution":{"observed_at":"2026-07-31T23:22:59.929958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2005.08540/citation-record","integrity":"/paper/2005.08540/integrity","json":"/paper/2005.08540/citation-record.json","paper":"/paper/2005.08540"},"outbound":[],"paper":{"arxiv_id":"2005.08540","last_updated":"2020-05-18T09:06:29Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-06T17:11:10.648548Z","submitted_at":"2020-05-18T09:06:29Z","title":"Approximate Denial Constraints"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2005.08540."}