{"as_of":"2026-08-10T23:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ca394dfbde06d9089a1452766f35b7f5691b0ded68378a4cb1c885a940f9a1d1","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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-07-10T06:05:38.945129Z","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-07-10T06:06:50.419228Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1808.04995","last_updated":"2018-08-15T07:58:32Z","snapshot_observed_at":"2026-07-06T06:55:44.797065Z","submitted_at":"2018-08-15T07:58:32Z","title":"The Sketching Complexity of Graph and Hypergraph Counting","version":1},"cited_work":{"arxiv_id":"1808.04995","doi":null,"metadata_source":"pith","pith_arxiv_id":"1808.04995","snapshot_observed_at":"2026-07-10T06:06:50.419228Z","title":"The Sketching Complexity of Graph and Hypergraph Counting","venue":"cs.DS","work_id":"87d1dd0d-99e2-486f-9ab7-135233e48c5e","year":2018},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1808.04995","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:77cc2d8f0c5aba147d4fc7d67c2233ad064560f561246513372a55f26ccb0fe2","observation_id":"ec05132b-55bb-49e2-9f71-a7b6a7c00a5b","resolution":{"observed_at":"2026-07-10T06:06:50.423588Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/1808.04995/citation-record","integrity":"/paper/1808.04995/integrity","json":"/paper/1808.04995/citation-record.json","paper":"/paper/1808.04995"},"outbound":[],"paper":{"arxiv_id":"1808.04995","last_updated":"2018-08-15T07:58:32Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T06:55:44.797065Z","submitted_at":"2018-08-15T07:58:32Z","title":"The Sketching Complexity of Graph and Hypergraph Counting"},"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 1 inbound Pith citation observation for arXiv:1808.04995."}