{"as_of":"2026-08-23T07:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:98f8d962f32c2b2241d91dc934d8063ff594ff428f590b63cbcffbf55172651b","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-23T06:30:58.430688+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-05-24T22:03:02.368614Z","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-05-24T22:04:59.866640Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1705.10464","last_updated":"2018-01-24T08:23:25Z","snapshot_observed_at":"2026-08-19T19:31:29.024335Z","submitted_at":"2017-05-30T06:07:16Z","title":"Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication","version":2},"cited_work":{"arxiv_id":"1705.10464","doi":null,"metadata_source":"pith","pith_arxiv_id":"1705.10464","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication","venue":"cs.IT","work_id":"c6dc5db2-9e97-491a-9e94-2b5aee8452a2","year":2017},"citing_paper":{"arxiv_id":"1907.05965","last_updated":"2019-07-12T21:40:27Z","snapshot_observed_at":"2026-07-06T08:07:29.177402Z","submitted_at":"2019-07-12T21:40:27Z","title":"Random Khatri-Rao-Product Codes for Numerically-Stable Distributed Matrix Multiplication","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-24T22:03:02.368614Z"},"links":{"cited_paper":"/paper/1705.10464","citing_paper":"/paper/1907.05965"},"observation_digest":"sha256:93a32266871cd64edb123b6fe91206ea866b554cff7c2a75e7a89b6ecf234a66","observation_id":"d18585d5-53f2-404a-b731-1413a8386362","resolution":{"observed_at":"2026-05-24T22:04:59.869611Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1705.10464/citation-record","integrity":"/paper/1705.10464/integrity","json":"/paper/1705.10464/citation-record.json","paper":"/paper/1705.10464"},"outbound":[],"paper":{"arxiv_id":"1705.10464","last_updated":"2018-01-24T08:23:25Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-19T19:31:29.024335Z","submitted_at":"2017-05-30T06:07:16Z","title":"Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1705.10464."}