{"as_of":"2026-08-08T04:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8021acdc4df548edd351e81e133b76668c1f97ac11ef47b7b32993b372a21d7c","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-07T06:34:17.273281+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.409585Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2105.01785","last_updated":"2021-07-14T21:58:25Z","snapshot_observed_at":"2026-08-03T12:20:10.709069Z","submitted_at":"2021-05-04T22:39:38Z","title":"An Optimal Algorithm for Triangle Counting in the Stream","version":2},"cited_work":{"arxiv_id":"2105.01785","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.01785","snapshot_observed_at":"2026-07-10T06:06:50.409585Z","title":"An Optimal Algorithm for Triangle Counting in the Stream","venue":"cs.DS","work_id":"296e3c81-c4ea-4602-bb97-3fcd7dd51352","year":2021},"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":17,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/2105.01785","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:d3b9902cb6414e89cab20c43cfec214a6378f3b19abbd5fc93c41a449d0e1d4f","observation_id":"ee641f2c-fd53-4bad-a199-d6f8c19b70e3","resolution":{"observed_at":"2026-07-10T06:06:50.415451Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2105.01785/citation-record","integrity":"/paper/2105.01785/integrity","json":"/paper/2105.01785/citation-record.json","paper":"/paper/2105.01785"},"outbound":[],"paper":{"arxiv_id":"2105.01785","last_updated":"2021-07-14T21:58:25Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-03T12:20:10.709069Z","submitted_at":"2021-05-04T22:39:38Z","title":"An Optimal Algorithm for Triangle Counting in the Stream"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2105.01785."}