{"as_of":"2026-08-20T05:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:05c15f46de668fa09e0d841e315c18268c90e873815b9f14897def19e2bbc8c8","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-19T06:32:44.657259+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-14T10:29:26.670428Z","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-14T10:18:58.365733Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1711.01623","last_updated":"2017-12-13T10:22:45Z","snapshot_observed_at":"2026-08-14T20:16:52.216220Z","submitted_at":"2017-11-05T17:45:37Z","title":"Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.01623","snapshot_observed_at":"2026-08-14T10:29:26.670428Z","title":"Fooling views: A new lower bound technique for distributed computations und er congestion","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.11488","last_updated":"2020-01-21T02:06:44Z","snapshot_observed_at":"2026-08-14T10:11:52.148859Z","submitted_at":"2019-08-30T00:10:08Z","title":"Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T10:29:26.670428Z"},"links":{"cited_paper":"/paper/1711.01623","citing_paper":"/paper/1908.11488"},"observation_digest":"sha256:df3d593351236bc4314e4567a4e1a05e1d87081326d177a0ca933c0e12caa1d0","observation_id":"83e120ee-a962-4301-89c1-f82ce24b064a","resolution":{"observed_at":"2026-08-14T10:29:26.670428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.01623","last_updated":"2017-12-13T10:22:45Z","snapshot_observed_at":"2026-08-14T20:16:52.216220Z","submitted_at":"2017-11-05T17:45:37Z","title":"Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion","version":3},"cited_work":{"arxiv_id":"1711.01623","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.01623","snapshot_observed_at":"2026-08-14T10:18:58.365733Z","title":"Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion","venue":"cs.DS","work_id":"7bf00641-124b-43d4-a827-802f3daae1e6","year":2017},"citing_paper":{"arxiv_id":"1908.11825","last_updated":"2020-05-20T15:50:42Z","snapshot_observed_at":"2026-08-18T06:08:15.873097Z","submitted_at":"2019-08-30T16:31:23Z","title":"The Communication Complexity of Set Intersection and Multiple Equality Testing","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T10:18:58.174584Z"},"links":{"cited_paper":"/paper/1711.01623","citing_paper":"/paper/1908.11825"},"observation_digest":"sha256:e59328036c9bf7cb6cae5b89306d482abe02c9601c92b91e94a4ccdad4323f5f","observation_id":"427c9ae0-36b6-4362-a68b-d987ed028cba","resolution":{"observed_at":"2026-08-14T10:18:58.373359Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1711.01623/citation-record","integrity":"/paper/1711.01623/integrity","json":"/paper/1711.01623/citation-record.json","paper":"/paper/1711.01623"},"outbound":[],"paper":{"arxiv_id":"1711.01623","last_updated":"2017-12-13T10:22:45Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T20:16:52.216220Z","submitted_at":"2017-11-05T17:45:37Z","title":"Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1711.01623."}