{"as_of":"2026-08-14T08:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2d554efe67cb1a8991d9003e87c46770969326e19fedaf52a9095c21cb03d7c8","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T22:03:02.368614Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"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.095407Z","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.201004Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.05965","snapshot_observed_at":"2026-08-14T06:07:19.095407Z","title":"Random khatri-rao-product codes for numerically-stable distributed matrix mul- tiplication,","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":17,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.095407Z"},"links":{"cited_paper":"/paper/1907.05965","citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:b22db05305e04c5662c2c21aa91af5ccd10d64a36bde32df521cc7fcbbc4bf85","observation_id":"57909cb2-9908-4cbf-a26e-f0bb8d2887d1","resolution":{"observed_at":"2026-08-14T06:07:19.095407Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"1907.05965","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.05965","snapshot_observed_at":"2026-08-08T11:07:07.201004Z","title":"Random Khatri-Rao-Product Codes for Numerically-Stable Distributed Matrix Multiplication","venue":"cs.IT","work_id":"64bf6c9c-0094-40f6-ac7e-d493094c0804","year":2019},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-11T01:46:05.888610Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.103262Z"},"links":{"cited_paper":"/paper/1907.05965","citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:e6e037027f0efad9ae4cd291ed0e7ba3fff172d0b382f50ce29e2aba5e0872ab","observation_id":"9d9b3a1f-b7d1-48a5-a08e-4a69449d0cf0","resolution":{"observed_at":"2026-08-08T11:07:07.207408Z","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.05965/citation-record","integrity":"/paper/1907.05965/integrity","json":"/paper/1907.05965/citation-record.json","paper":"/paper/1907.05965"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1705.10464","last_updated":"2018-01-24T08:23:25Z","snapshot_observed_at":"2026-07-06T05:44:45.871189Z","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:68cd19496c9c8c558e0cc31f194c7e5022cbd19b66206a09163ee400ed242818","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-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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Numerically stable polynomial ly coded computing","venue":null,"work_id":"a09882b2-2369-49f5-86c4-4da29e67bb6e","year":2019},"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":2,"source":"pdf_text","source_observed_at":"2026-05-24T22:03:02.368614Z"},"links":{"citing_paper":"/paper/1907.05965"},"observation_digest":"sha256:58520a9c7a21fb66dada5ca16846c0693b1198c64223f91d520be1f3476a2feb","observation_id":"63d819b1-d8a0-4760-b6b5-e064d21bdb13","resolution":{"observed_at":"2026-05-24T22:05:00.616702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1801.07487","last_updated":"2020-04-09T17:50:03Z","snapshot_observed_at":"2026-08-14T06:48:53.671719Z","submitted_at":"2018-01-23T11:34:59Z","title":"Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding","version":5},"cited_work":{"arxiv_id":"1801.07487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1801.07487","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding","venue":null,"work_id":"b2983eb0-56a7-4137-8dd0-bcba52c510ab","year":2018},"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":3,"source":"pdf_text","source_observed_at":"2026-05-24T22:03:02.368614Z"},"links":{"cited_paper":"/paper/1801.07487","citing_paper":"/paper/1907.05965"},"observation_digest":"sha256:2cbaf67ed90365903ba820f8c3ecb673a6d482ea3280c11277b81e3ca5709906","observation_id":"da831ab4-4c58-4623-a2b3-39e375a900f0","resolution":{"observed_at":"2026-05-24T22:04:59.874916Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"1811.10751","last_updated":"2018-11-27T00:06:47Z","snapshot_observed_at":"2026-08-04T05:33:21.043203Z","submitted_at":"2018-11-27T00:06:47Z","title":"A Unified Coded Deep Neural Network Training Strategy Based on Generalized PolyDot Codes for Matrix Multiplication","version":1},"cited_work":{"arxiv_id":"1811.10751","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.10751","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Unified Coded Deep Neural Network Training Strategy Based on Generalized PolyDot Codes for Matrix Multiplication","venue":"cs.IT","work_id":"5846b459-6b93-4a9f-94f4-665740a80258","year":2018},"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":4,"source":"pdf_text","source_observed_at":"2026-05-24T22:03:02.368614Z"},"links":{"cited_paper":"/paper/1811.10751","citing_paper":"/paper/1907.05965"},"observation_digest":"sha256:0a0f28a97b8a880206ea74572578f74f00d5acfbc4635c1796a51abcab81d9ab","observation_id":"8cd7d68d-1bb6-4f6e-81e7-fcfa4c37dc3d","resolution":{"observed_at":"2026-05-24T22:04:59.853721Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1901.10674","last_updated":"2019-01-30T04:42:09Z","snapshot_observed_at":"2026-08-10T10:23:44.547464Z","submitted_at":"2019-01-30T04:42:09Z","title":"Universally Decodable Matrices for Distributed Matrix-Vector Multiplication","version":1},"cited_work":{"arxiv_id":"1901.10674","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.10674","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Universally Decodable Matrices for Distributed Matrix-Vector Multiplication","venue":"cs.IT","work_id":"3e9cee8f-2369-4500-a6d8-8d6e77d04120","year":2019},"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":5,"source":"pdf_text","source_observed_at":"2026-05-24T22:03:02.368614Z"},"links":{"cited_paper":"/paper/1901.10674","citing_paper":"/paper/1907.05965"},"observation_digest":"sha256:8c18028239d3fc224a1222e44adcd1623c9f5963cca9122378731d83718e1315","observation_id":"dac4cf34-3dc7-49e4-82cd-b547a8199335","resolution":{"observed_at":"2026-05-24T22:04:59.858911Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1806.00939","last_updated":"2019-04-01T19:09:28Z","snapshot_observed_at":"2026-07-06T06:42:45.078166Z","submitted_at":"2018-06-04T03:26:22Z","title":"Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy","version":4},"cited_work":{"arxiv_id":"1806.00939","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.00939","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy","venue":"cs.IT","work_id":"1d71d1b5-8720-437a-a371-fe36e073d31b","year":2018},"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":6,"source":"pdf_text","source_observed_at":"2026-05-24T22:03:02.368614Z"},"links":{"cited_paper":"/paper/1806.00939","citing_paper":"/paper/1907.05965"},"observation_digest":"sha256:f3d5ae4aee3290cff2b94abbcd451416db7daaf4d0cfa5f34b8c44227d91d9f6","observation_id":"391d17dc-f277-4d96-b32b-e50c2349e53b","resolution":{"observed_at":"2026-05-24T22:04:59.847905Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1512.02673","last_updated":"2018-01-29T03:04:14Z","snapshot_observed_at":"2026-08-02T12:01:10.192069Z","submitted_at":"2015-12-08T21:54:04Z","title":"Speeding Up Distributed Machine Learning Using Codes","version":3},"cited_work":{"arxiv_id":"1512.02673","doi":null,"metadata_source":"pith","pith_arxiv_id":"1512.02673","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Speeding Up Distributed Machine Learning Using Codes","venue":"cs.DC","work_id":"ef422533-89a5-4cb7-ba78-7c2071d0e19c","year":2015},"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":7,"source":"pdf_text","source_observed_at":"2026-05-24T22:03:02.368614Z"},"links":{"cited_paper":"/paper/1512.02673","citing_paper":"/paper/1907.05965"},"observation_digest":"sha256:3d515f93ccb2a746c5c7422677dc28e94c46c8430cc7c7eae226bd71ab39e510","observation_id":"32c1bffc-7162-4a56-8803-6e9b42d8a767","resolution":{"observed_at":"2026-05-24T22:04:59.880140Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1704.05181","last_updated":"2017-04-18T02:45:30Z","snapshot_observed_at":"2026-07-06T05:38:09.776346Z","submitted_at":"2017-04-18T02:45:30Z","title":"\"Short-Dot\": Computing Large Linear Transforms Distributedly Using Coded Short Dot Products","version":1},"cited_work":{"arxiv_id":"1704.05181","doi":null,"metadata_source":"pith","pith_arxiv_id":"1704.05181","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"\"Short-Dot\": Computing Large Linear Transforms Distributedly Using Coded Short Dot Products","venue":"cs.IT","work_id":"a561743c-73a9-4927-8678-5edd3e72219b","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":8,"source":"pdf_text","source_observed_at":"2026-05-24T22:03:02.368614Z"},"links":{"cited_paper":"/paper/1704.05181","citing_paper":"/paper/1907.05965"},"observation_digest":"sha256:b6583790eb4976b94ae8b9394b86b8d4827d3f21d9d4930a9700ebefde6fb4b5","observation_id":"082e8f6f-1f97-488d-8cad-b982e00748e5","resolution":{"observed_at":"2026-05-24T22:04:59.864403Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A unified co ding framework for distributed computing with straggling servers","venue":null,"work_id":"7053bb47-e45f-4fa9-b67c-3f13610fdd60","year":2016},"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":9,"source":"pdf_text","source_observed_at":"2026-05-24T22:03:02.368614Z"},"links":{"citing_paper":"/paper/1907.05965"},"observation_digest":"sha256:623cbd0c3aa86652e3d31b37bc7786cde0dd56dac0928d62e560191b1f939cc5","observation_id":"7ac35cb2-0c34-4bff-ae5b-e6f0b6c3ac09","resolution":{"observed_at":"2026-05-24T22:05:00.609856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"High-dimensional c oded matrix multiplication","venue":null,"work_id":"a2283547-a948-4ac0-a3bb-d01a02071f64","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":10,"source":"pdf_text","source_observed_at":"2026-05-24T22:03:02.368614Z"},"links":{"citing_paper":"/paper/1907.05965"},"observation_digest":"sha256:6426a027d268236d641e6dd50d11d5cac8caaddf77f2dd202fb660904032516a","observation_id":"f77a9612-847e-414b-b404-a29328e8f2d1","resolution":{"observed_at":"2026-05-24T22:05:00.600194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Coded dis tributed computing: Straggling servers and multistage dat aflows","venue":null,"work_id":"0fe05483-bfda-485b-9298-880d5ad769fa","year":2016},"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":11,"source":"pdf_text","source_observed_at":"2026-05-24T22:03:02.368614Z"},"links":{"citing_paper":"/paper/1907.05965"},"observation_digest":"sha256:5cb16d9f9f3f90e342b12f662c7f20e5db9890d4832524231ef6ccf98a995d58","observation_id":"97fe3984-af5e-48dd-83f8-72931d326a54","resolution":{"observed_at":"2026-05-24T22:05:00.606444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Coded distributed compu ting for inverse problems","venue":null,"work_id":"2e3e052f-bb93-40a6-9b7f-e8b9a2eab169","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":12,"source":"pdf_text","source_observed_at":"2026-05-24T22:03:02.368614Z"},"links":{"citing_paper":"/paper/1907.05965"},"observation_digest":"sha256:a239728996409a9a890c0fc1785fa074f2bbc281fa39fcea09a6600e73f7c312","observation_id":"eb0202df-d2d0-4e5c-b3e3-69418b56b298","resolution":{"observed_at":"2026-05-24T22:05:00.613241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Almos t-sure identifiability of multidimensional harmonic retri eval","venue":null,"work_id":"345e5e6c-7751-47f2-a448-a0d92931afc6","year":2001},"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":13,"source":"pdf_text","source_observed_at":"2026-05-24T22:03:02.368614Z"},"links":{"citing_paper":"/paper/1907.05965"},"observation_digest":"sha256:411791c57fa6bd10f7dce7baba49ce69d177b86d7dca0ca6e2028bde0b9011a0","observation_id":"4b340a50-939b-4e81-82c5-77aa76857a4c","resolution":{"observed_at":"2026-05-24T22:05:00.603162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Eigenvalues and condition numbers of rand om matrices","venue":null,"work_id":"6f608c41-580d-41ae-a904-31e5826cf590","year":1988},"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":14,"source":"pdf_text","source_observed_at":"2026-05-24T22:03:02.368614Z"},"links":{"citing_paper":"/paper/1907.05965"},"observation_digest":"sha256:b1ca5487938705e889ec61c18fb4987749357ae7fa4d488c8efbdbb88c9be9d5","observation_id":"d83bdf4e-6670-424a-8378-d51b01829fba","resolution":{"observed_at":"2026-05-24T22:05:00.597040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"1907.05965","last_updated":"2019-07-12T21:40:27Z","latest_version":1,"primary_category":"cs.IT","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"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":7,"verified_fuzzy":7},"total_outbound_references":14},"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 14 of 14 outbound references and 2 inbound Pith citation observations for arXiv:1907.05965."}