{"as_of":"2026-08-09T07:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ea1c4e785b9a62505cdfd3bdcc6024e2f81e65b5be13eadb03b185b9e8278810","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-09T06:31:02.800959+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.451360Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1705.09061","last_updated":"2017-05-25T06:24:25Z","snapshot_observed_at":"2026-08-06T10:44:49.525825Z","submitted_at":"2017-05-25T06:24:25Z","title":"Triangle Finding and Listing in CONGEST Networks","version":1},"cited_work":{"arxiv_id":"1705.09061","doi":null,"metadata_source":"pith","pith_arxiv_id":"1705.09061","snapshot_observed_at":"2026-07-10T06:06:50.451360Z","title":"Triangle Finding and Listing in CONGEST Networks","venue":"cs.DC","work_id":"d9d1429e-72c7-4cea-b0e5-30e35a81b1fa","year":2017},"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":40,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1705.09061","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:17714e747dc1613965081ca4af4f644d19edbcceff7630fe20588e761c96d84f","observation_id":"abbcd4e4-57cd-4740-8b14-ad1cec9e10b9","resolution":{"observed_at":"2026-07-10T06:06:50.452475Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/1705.09061/citation-record","integrity":"/paper/1705.09061/integrity","json":"/paper/1705.09061/citation-record.json","paper":"/paper/1705.09061"},"outbound":[],"paper":{"arxiv_id":"1705.09061","last_updated":"2017-05-25T06:24:25Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-06T10:44:49.525825Z","submitted_at":"2017-05-25T06:24:25Z","title":"Triangle Finding and Listing in CONGEST Networks"},"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 1 inbound Pith citation observation for arXiv:1705.09061."}