{"as_of":"2026-08-10T01:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9f3d70fafc801ff2914b1306e493a2246f8884957ffa40285cf032aa80ce12af","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-08-08T15:24:32.322062Z","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-08T15:24:32.350587Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1409.6366","last_updated":"2014-09-22T22:40:24Z","snapshot_observed_at":"2026-08-09T10:11:49.232731Z","submitted_at":"2014-09-22T22:40:24Z","title":"A direct proof for Lovett's bound on the communication complexity of low rank matrices","version":1},"cited_work":{"arxiv_id":"1409.6366","doi":null,"metadata_source":"pith","pith_arxiv_id":"1409.6366","snapshot_observed_at":"2026-08-08T15:24:32.350587Z","title":"A direct proof for Lovett's bound on the communication complexity of low rank matrices","venue":"cs.CC","work_id":"ef16ac76-185f-4c94-8548-2ff22cfd095f","year":2014},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-09T23:10:35.221253Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":1995,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.322062Z"},"links":{"cited_paper":"/paper/1409.6366","citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:ff6cab8ab57052f55186afd1dfaa6de8a7da1e90d4cb64d19bd252b121159f29","observation_id":"57e2fde3-3afc-452f-a261-1a5010e6a24a","resolution":{"observed_at":"2026-08-08T15:24:32.356564Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/1409.6366/citation-record","integrity":"/paper/1409.6366/integrity","json":"/paper/1409.6366/citation-record.json","paper":"/paper/1409.6366"},"outbound":[],"paper":{"arxiv_id":"1409.6366","last_updated":"2014-09-22T22:40:24Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-09T10:11:49.232731Z","submitted_at":"2014-09-22T22:40:24Z","title":"A direct proof for Lovett's bound on the communication complexity of low rank matrices"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1409.6366."}