{"as_of":"2026-08-15T09:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f23863be2b2d57b2beaeb3d8e695c684bbfdbcfacf548c0cba9141669bcb2860","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-15T06:32:42.880941+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-14T06:07:19.090589Z","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-14T06:07:19.441704Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1903.08326","last_updated":"2019-05-22T16:33:35Z","snapshot_observed_at":"2026-08-14T16:59:41.536088Z","submitted_at":"2019-03-20T03:24:53Z","title":"Numerically Stable Polynomially Coded Computing","version":2},"cited_work":{"arxiv_id":"1903.08326","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.08326","snapshot_observed_at":"2026-08-14T06:07:19.441704Z","title":"Numerically Stable Polynomially Coded Computing","venue":"cs.IT","work_id":"41728f5a-0f3e-4103-9f8f-5f13719864f9","year":2019},"citing_paper":{"arxiv_id":"1909.00407","last_updated":"2019-12-18T18:36:45Z","snapshot_observed_at":"2026-08-14T23:34:54.662960Z","submitted_at":"2019-09-01T14:09:01Z","title":"Private and Secure Distributed Matrix Multiplication with Flexible Communication Load","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.090589Z"},"links":{"cited_paper":"/paper/1903.08326","citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:bdd56162cde15404067549a049b00c40035ec8f17d5e3d075c24dc99c38c8db7","observation_id":"be57ecb5-285b-4c60-9162-2d9ef7611f02","resolution":{"observed_at":"2026-08-14T06:07:19.446387Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1903.08326/citation-record","integrity":"/paper/1903.08326/integrity","json":"/paper/1903.08326/citation-record.json","paper":"/paper/1903.08326"},"outbound":[],"paper":{"arxiv_id":"1903.08326","last_updated":"2019-05-22T16:33:35Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T16:59:41.536088Z","submitted_at":"2019-03-20T03:24:53Z","title":"Numerically Stable Polynomially Coded Computing"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1903.08326."}