{"as_of":"2026-08-14T17:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7e9e13c1102991abb91615a8cfe10d9667b04dea567ef3014db45055b382c03b","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-14T06:32:32.682623+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-14T06:07:19.126208Z","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-08T11:07:07.219129Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.08064","last_updated":"2020-06-01T18:12:02Z","snapshot_observed_at":"2026-08-14T16:04:42.662379Z","submitted_at":"2019-07-18T14:12:26Z","title":"Efficient and Robust Distributed Matrix Computations via Convolutional Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.08064","snapshot_observed_at":"2026-08-14T06:07:19.126208Z","title":"Random convolutional coding for robust and straggler resilient distributed matrix computation,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"1909.00407","last_updated":"2019-12-18T18:36:45Z","snapshot_observed_at":"2026-08-14T05:51:34.825754Z","submitted_at":"2019-09-01T14:09:01Z","title":"Private and Secure Distributed Matrix Multiplication with Flexible Communication Load","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.126208Z"},"links":{"cited_paper":"/paper/1907.08064","citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:778cb782d839ac29a9e55e943e0b18aff0a0febaeee44c4ff9a89b26a0435f0c","observation_id":"51bcb500-ce79-484e-ae81-5fd168a60053","resolution":{"observed_at":"2026-08-14T06:07:19.126208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.08064","last_updated":"2020-06-01T18:12:02Z","snapshot_observed_at":"2026-08-14T16:04:42.662379Z","submitted_at":"2019-07-18T14:12:26Z","title":"Efficient and Robust Distributed Matrix Computations via Convolutional Coding","version":2},"cited_work":{"arxiv_id":"1907.08064","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.08064","snapshot_observed_at":"2026-08-08T11:07:07.219129Z","title":"Efficient and Robust Distributed Matrix Computations via Convolutional Coding","venue":"cs.IT","work_id":"559e5e9e-928f-4300-b4eb-a07671861c56","year":2019},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.056735Z"},"links":{"cited_paper":"/paper/1907.08064","citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:c058ab8cfc715e76dad6d038c6a544016a7e842c79ba80ce66b9814b8fc29275","observation_id":"18c21f4c-3060-4a46-84b0-90b67f260e3c","resolution":{"observed_at":"2026-08-08T11:07:07.223268Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1907.08064/citation-record","integrity":"/paper/1907.08064/integrity","json":"/paper/1907.08064/citation-record.json","paper":"/paper/1907.08064"},"outbound":[],"paper":{"arxiv_id":"1907.08064","last_updated":"2020-06-01T18:12:02Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T16:04:42.662379Z","submitted_at":"2019-07-18T14:12:26Z","title":"Efficient and Robust Distributed Matrix Computations via Convolutional Coding"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1907.08064."}