{"as_of":"2026-08-15T07:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:da3b29a65ce6a90495170debb438bf5966d15c63ee9affc15361c7ed3528ca04","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T06:07:19.218190Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1909.00407/citation-record","integrity":"/paper/1909.00407/integrity","json":"/paper/1909.00407/citation-record.json","paper":"/paper/1909.00407"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.848997Z","title":"Distributed and private coded matrix computation with flexible communication load,","venue":null,"work_id":"06fde9b7-bef2-46e2-8f2b-41a27e5f7268","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":1,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.026473Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:9ac549ee0ddc6a0cc15ad8ff5009bc329cbdf40754d9f4097941c7c961a20d66","observation_id":"eda34047-bec0-4350-973f-36fcc016bbee","resolution":{"observed_at":"2026-08-14T06:07:19.853545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1506.08473","last_updated":"2016-01-12T03:19:42Z","snapshot_observed_at":"2026-08-14T22:42:38.256157Z","submitted_at":"2015-06-28T23:19:49Z","title":"Beating the Perils of Non-Convexity: Guaranteed Training of Neural Networks using Tensor Methods","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.08473","snapshot_observed_at":"2026-08-14T06:07:19.031033Z","title":"Beating the perils of non-convexity: Guaranteed training of neural networks using tensor methods,","venue":null,"work_id":null,"year":2015},"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":2,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.031033Z"},"links":{"cited_paper":"/paper/1506.08473","citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:ab4981a9e7c4db13b70eb7608cb9a141a327dd6e7dfcd477f3fc387c5653545d","observation_id":"40ae4dc6-a9a9-4a35-a649-bdd4c6c481df","resolution":{"observed_at":"2026-08-14T06:07:19.031033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.833464Z","title":"Scaling distributed machine learning with the parameter server","venue":null,"work_id":"0fe4cca3-d15f-4529-b9a3-6b8796904a21","year":2014},"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":3,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.035499Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:68dab46599658209e2a54b15520795797ebd9b41628e5604f80249085c5c6e1d","observation_id":"f76adada-e69a-4974-aaab-9fd4f62dd442","resolution":{"observed_at":"2026-08-14T06:07:19.840498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.821836Z","title":"The tail at scale,","venue":null,"work_id":"7c3e3f57-7af2-45c3-9ab8-67be4fb60325","year":2013},"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":4,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.039816Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:89a781014c0c7c9aba1561000db53e49b02cba66883248b9af55c65d47f761e2","observation_id":"7ae53540-09ca-4464-88c2-64d2c259488b","resolution":{"observed_at":"2026-08-14T06:07:19.825837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.810722Z","title":"Efficient redundancy techniques for latency reduction in cloud systems,","venue":null,"work_id":"069b4872-7498-44fd-a2eb-8dd6bbbc2ff9","year":2017},"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":5,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.044123Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:2654655d9080b272a3b1381979c1dc91417b32980cfbf413538e1bd97079ce08","observation_id":"b813fb95-e5a0-4fc5-85f0-07af38175cfd","resolution":{"observed_at":"2026-08-14T06:07:19.814589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.799510Z","title":"Using straggler replication to reduce latency in large-scale parallel computing,","venue":null,"work_id":"e9cd4852-3200-466b-8b76-e1186f996928","year":2015},"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":6,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.048164Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:46754975c42f1b30f59a0c8d4351be9eeef8d325e132cee581fe20588980c957","observation_id":"3963f895-7f9a-4293-ab9f-326c6dfcf7f2","resolution":{"observed_at":"2026-08-14T06:07:19.803555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.780414Z","title":"Algorithm-based fault tolerance for matrix operations,","venue":null,"work_id":"c613ae98-b324-4666-a7a8-51cef6352796","year":1984},"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":7,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.052613Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:f82eb75afcb54e109763a2dfc5594ffc4e30412e76dcc8fc8d84e1c495f3038d","observation_id":"11751fe9-1fea-4b38-b8f8-cfb4854aad75","resolution":{"observed_at":"2026-08-14T06:07:19.789674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.768193Z","title":"Speeding up distributed machine learning using codes,","venue":null,"work_id":"265dc408-f705-4fde-8fd6-d81b2d9bce11","year":2017},"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":8,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.057439Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:0515c5f7bcd699ad3eaa715997f62db79ff5bad38c5aa6103053d2a385978493","observation_id":"127cfbf8-a3c1-4042-8f3d-da2689068f77","resolution":{"observed_at":"2026-08-14T06:07:19.772664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.756652Z","title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication,","venue":null,"work_id":"8d818808-7d25-40d1-8a4c-0a463f92042d","year":2017},"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":9,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.061225Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:71e6614948d38a94d26695e77719d93609a3b67056fe4f4f0220c784204d5569","observation_id":"1c119a73-564c-433e-84e2-34fa4db96036","resolution":{"observed_at":"2026-08-14T06:07:19.760747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.745496Z","title":"A fundamental tradeoff between computation and communication in distributed com- puting,","venue":null,"work_id":"7269d25d-5ef1-46b1-98a5-dbfb00e088a8","year":2017},"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":10,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.065778Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:d9a8405506c3d2f6278460de4aad25a89a9b3d12fcca3eb63df2df953f7c83a1","observation_id":"eac99997-21f7-481f-9e37-2bacecd35ad8","resolution":{"observed_at":"2026-08-14T06:07:19.749262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.731117Z","title":"Coded computation against processing delays for virtualized cloud-based channel decoding,","venue":null,"work_id":"24b22ee0-a485-4060-9f26-c807241bbcfe","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":11,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.069580Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:b99dc5c6c1bb69519ef2e1d59b6775f1fbfed4803bce9d8318bc4f72109872ca","observation_id":"9b21f005-7e68-45e3-965a-da869ed5461c","resolution":{"observed_at":"2026-08-14T06:07:19.736057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.718850Z","title":"Coded computation against straggling decoders for network function virtualization,","venue":null,"work_id":"806cf627-bbfa-4669-8490-4f89171b17e0","year":2018},"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":12,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.073644Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:ed31526251650bfa06f7a0b03fdc986825f4989e052ba9b3d5b8271fda89edd1","observation_id":"2cf9ec13-656f-4605-b0e3-20159e95c502","resolution":{"observed_at":"2026-08-14T06:07:19.723353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1801.10292","last_updated":"2018-05-16T17:04:14Z","snapshot_observed_at":"2026-08-14T19:50:27.490705Z","submitted_at":"2018-01-31T04:13:09Z","title":"On the Optimal Recovery Threshold of Coded Matrix Multiplication","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.10292","snapshot_observed_at":"2026-08-14T06:07:19.077598Z","title":"On the optimal recovery threshold of coded matrix mul- tiplication,","venue":null,"work_id":null,"year":2018},"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":13,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.077598Z"},"links":{"cited_paper":"/paper/1801.10292","citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:874cfd08ff688b887ca65781baac31768eab3e1f19b3dba388eaa7d83e04474b","observation_id":"5b4e6ecd-0fad-417b-8000-c1f732816fce","resolution":{"observed_at":"2026-08-14T06:07:19.077598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.10751","last_updated":"2018-11-27T00:06:47Z","snapshot_observed_at":"2026-08-14T17:52:57.111956Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.10751","snapshot_observed_at":"2026-08-14T06:07:19.081987Z","title":"A unified coded deep neural network training strategy based on generalized polydot codes for matrix multiplication,","venue":null,"work_id":null,"year":2018},"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":14,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.081987Z"},"links":{"cited_paper":"/paper/1811.10751","citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:bec2f5a6cd2ad7b446d930ff5f9470ca3cce8cbc36c0b1a91ae5251e376d7ee3","observation_id":"faed122a-874a-4eab-9dd0-4559129fcda6","resolution":{"observed_at":"2026-08-14T06:07:19.081987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.704567Z","title":"On the optimal recovery threshold of coded matrix mul- tiplication,","venue":null,"work_id":"46d3ec2d-e5b7-4633-90d3-5ffff210a5e8","year":2017},"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":15,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.086482Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:824438284fc0b7a1f32abf067559cf143a68eb4ecdb3d264f97a3f02ddc9c5d7","observation_id":"68bc3900-ba5f-4f6d-a0f4-38e1d01eb617","resolution":{"observed_at":"2026-08-14T06:07:19.709026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"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"}},{"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-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":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:543dea56a86fa0c4b37b71b9c4c38485e5e6b7b630f3197133a56e519ce5f5d5","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.691589Z","title":"Limited-sharing multi-party computation for massive matrix operations,","venue":null,"work_id":"d8f599a7-46b2-4b3a-b3b1-93a7d0a5c3ae","year":2018},"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":18,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.099595Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:342931b0cf03abc4e0212b4a045457dad844b328b5f91e3380a83b1cdb08b894","observation_id":"2f8641d1-8386-4c8f-81f8-cccd3f806ade","resolution":{"observed_at":"2026-08-14T06:07:19.695699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1806.00939","last_updated":"2019-04-01T19:09:28Z","snapshot_observed_at":"2026-08-14T19:07:59.597864Z","submitted_at":"2018-06-04T03:26:22Z","title":"Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.00939","snapshot_observed_at":"2026-08-14T06:07:19.103829Z","title":"Lagrange coded computing: Optimal design for resiliency, security and privacy,","venue":null,"work_id":null,"year":2018},"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":19,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.103829Z"},"links":{"cited_paper":"/paper/1806.00939","citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:64565c68e40b847d4239b6a990558d7852e293144e579669f8885a9564ebe41d","observation_id":"ee345e11-c5c9-46be-aded-60c4dc722326","resolution":{"observed_at":"2026-08-14T06:07:19.103829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.00469","last_updated":"2018-06-01T17:59:16Z","snapshot_observed_at":"2026-08-14T19:08:25.844240Z","submitted_at":"2018-06-01T17:59:16Z","title":"On the Capacity of Secure Distributed Matrix Multiplication","version":1},"cited_work":{"arxiv_id":"1806.00469","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.00469","snapshot_observed_at":"2026-08-14T06:07:19.398140Z","title":"On the Capacity of Secure Distributed Matrix Multiplication","venue":"cs.IT","work_id":"8bd8cc9c-485e-4550-9f9b-3456d008be49","year":2018},"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":20,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.108991Z"},"links":{"cited_paper":"/paper/1806.00469","citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:43a931313dfb7c5a71786ac98c10e0ffc62ebd062d6664b9c9f05a9cf18e761f","observation_id":"805f446b-2ee7-4f7e-9a38-da919c27028b","resolution":{"observed_at":"2026-08-14T06:07:19.404273Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.679995Z","title":"On the capacity and straggler- robustness of distributed secure matrix multiplication,","venue":null,"work_id":"1b3072e0-3e66-4682-a08e-f82f71e50e2e","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":21,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.113589Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:07734b11aa3640f64ebb60c9a7dcaf5e21c8c6209c5dcf435be07ff632924ad9","observation_id":"f5001572-32c5-43dd-a6c0-795dc5a73644","resolution":{"observed_at":"2026-08-14T06:07:19.684211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.668126Z","title":"Secure distributed computing with straggling servers using polynomial codes,","venue":null,"work_id":"a18aed43-b941-45f3-a99f-101bb0316eaf","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":22,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.117752Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:1c6e5466ed6455481d23e20f797d4416aa8ba9524838ed13ebd52a7861c0eac6","observation_id":"b3d5e595-0325-46e1-baa5-2b34d49978cd","resolution":{"observed_at":"2026-08-14T06:07:19.672493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1812.09962","last_updated":"2020-02-11T21:52:09Z","snapshot_observed_at":"2026-08-14T17:38:48.062364Z","submitted_at":"2018-12-24T18:28:12Z","title":"GASP Codes for Secure Distributed Matrix Multiplication","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.09962","snapshot_observed_at":"2026-08-14T06:07:19.121826Z","title":"GASP codes for secure distributed matrix multiplication,","venue":null,"work_id":null,"year":2018},"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":23,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.121826Z"},"links":{"cited_paper":"/paper/1812.09962","citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:c59cf0ad144c0ff6f9e5f6535bfb193b9af097fdb6291a3cc0369ea1dbaf1c26","observation_id":"add38c56-82b0-46d1-b447-5ae85827f00e","resolution":{"observed_at":"2026-08-14T06:07:19.121826Z","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":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-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":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:c7c3fc35689feaf3ab90552f4bc5cc7a55816e2a6638ea8d67ff48be5509cb58","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":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"cited_work":{"arxiv_id":"1908.04255","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.04255","snapshot_observed_at":"2026-08-14T06:07:19.356662Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","venue":"cs.IT","work_id":"d703279d-9051-4712-848e-c9e564daf0df","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":25,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.130524Z"},"links":{"cited_paper":"/paper/1908.04255","citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:24661b4913c6a3a95589158ac93536692e94a5e5bf2ef17f0e3ffb12dda8ee46","observation_id":"6a53c7ca-2479-4798-9b77-354f40f94159","resolution":{"observed_at":"2026-08-14T06:07:19.361071Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.656596Z","title":"Ricci, L","venue":null,"work_id":"48a26670-9897-4150-929d-17c0ec7465c7","year":2011},"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":26,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.134579Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:4d552ad4eec59607325bb8cf462f1498ba36268404a9a0dc008d1699e59fe673","observation_id":"4214f115-04a6-4f85-9f35-6ae19d1c6824","resolution":{"observed_at":"2026-08-14T06:07:19.660658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.645067Z","title":"High-dimensional coded matrix multiplication,","venue":null,"work_id":"2225fc0e-2ef8-4dd8-aac9-ccb49096c055","year":2017},"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":27,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.138355Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:b9f06c75d087172b7915d4e834f17976ffbce95e257bb9e3284e820021812807","observation_id":"f929b69b-4a26-4137-aec6-64f595041146","resolution":{"observed_at":"2026-08-14T06:07:19.648892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1801.07487","last_updated":"2020-04-09T17:50:03Z","snapshot_observed_at":"2026-08-14T19:52:51.163249Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.07487","snapshot_observed_at":"2026-08-14T06:07:19.142150Z","title":"Straggler mitigation in distributed matrix multiplication: Fundamental limits and optimal coding,","venue":null,"work_id":null,"year":2018},"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":28,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.142150Z"},"links":{"cited_paper":"/paper/1801.07487","citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:de5f08ddde2d53fdfeb217ce3ff941e59045e6bd235fe6557d6edd4ef164c287","observation_id":"2ffa847f-64d0-4fb3-a011-7baed46b5e21","resolution":{"observed_at":"2026-08-14T06:07:19.142150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"cited_work":{"arxiv_id":"1908.06957","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.06957","snapshot_observed_at":"2026-08-14T06:07:19.323615Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","venue":"cs.IT","work_id":"42879d87-ef10-4b13-a507-7254656f3095","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":29,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.146832Z"},"links":{"cited_paper":"/paper/1908.06957","citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:9116189d378bc1969c4ffe1cc0f903732f078638a085d5cc949ef737b458740a","observation_id":"e5dad731-08f9-40a8-900e-7c21ac8bfc15","resolution":{"observed_at":"2026-08-14T06:07:19.328370Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.633696Z","title":"Private infor- mation retrieval,","venue":null,"work_id":"e7ffe113-9203-4e44-94b3-8f44cebce8fe","year":1995},"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":30,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.150948Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:93dbcdd5b7cb90f035b38deec661d781edf2f065ec5fb8d4e3235f1dbfe1a9a9","observation_id":"6ff742cf-dddf-4a1e-8a2b-e32af1ef40ee","resolution":{"observed_at":"2026-08-14T06:07:19.637724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.622008Z","title":"A survey on private information retrieval,","venue":null,"work_id":"673f28c0-761d-4bff-815b-40094552ef92","year":2004},"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":31,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.154646Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:e3feb20c6659db6fb9525b1c0b0a36b57387921a90c70d1b48505340fb1d0bbe","observation_id":"941fa8cb-64a2-4141-86d1-8330b08aef40","resolution":{"observed_at":"2026-08-14T06:07:19.626113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.609955Z","title":"Private information retrieval,","venue":null,"work_id":"a2bc1c03-aa76-4b4e-afb9-abaad0a934c1","year":2010},"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":32,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.158824Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:3e7c8df5e69795f61765c9eafeb863c3b15baecfdc307124cbb68b6e7c5eddb5","observation_id":"44969c94-2645-44ef-b0c2-b31514beffe2","resolution":{"observed_at":"2026-08-14T06:07:19.613974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.595217Z","title":"The capacity of private information retrieval,","venue":null,"work_id":"314be208-e4e2-4e64-8854-a715f989e18e","year":2017},"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":33,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.162675Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:427b634f03fe8d2e23bdb41598f704dba391c3c3ff38149174683ff4677104fd","observation_id":"f0355d0e-51f2-48f4-9491-f0ac37ad1b25","resolution":{"observed_at":"2026-08-14T06:07:19.599455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.581201Z","title":"The capacity of private information retrieval from coded databases,","venue":null,"work_id":"84652696-6042-48f7-a0e5-ca3ac6000d59","year":1945},"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":34,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.166875Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:ef7647ff46d19525037fca361acfa39b3a952c5759fd6121597da54db4828673","observation_id":"8c5fbb62-1671-4778-b658-7c955c9a3a05","resolution":{"observed_at":"2026-08-14T06:07:19.585606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.567366Z","title":"Private information retrieval from coded databases with colluding servers,","venue":null,"work_id":"6bfe7f64-5ffb-4a62-903a-947bf78a4f19","year":2017},"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":35,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.170824Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:99e1d64b5de68faf509e403a50d815e65fcceed666e5bcea09320e5c11d8fd9a","observation_id":"51f72803-5fa6-4342-ab6b-1cdaa0cd18b1","resolution":{"observed_at":"2026-08-14T06:07:19.572832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.555002Z","title":"Single- server single-message online private information retrieval with side information,","venue":null,"work_id":"ad18e941-99ff-42e5-92af-f8da6f19da96","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":36,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.174650Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:6391bd03c7df4f68904604a2282378b0f6d62e3ebfeee9c5c302d4dad7cd4460","observation_id":"ecd478d8-ad80-4d75-851d-e4023d2d3fd2","resolution":{"observed_at":"2026-08-14T06:07:19.559431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1906.11278","last_updated":"2019-06-26T18:12:01Z","snapshot_observed_at":"2026-08-07T16:56:26.919261Z","submitted_at":"2019-06-26T18:12:01Z","title":"Private Information Retrieval with Private Coded Side Information: The Multi-Server Case","version":1},"cited_work":{"arxiv_id":"1906.11278","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.11278","snapshot_observed_at":"2026-08-14T06:07:19.305087Z","title":"Private Information Retrieval with Private Coded Side Information: The Multi-Server Case","venue":"cs.IT","work_id":"81fe1ee0-0e7f-4080-88f2-5f6aec85d49b","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":37,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.179209Z"},"links":{"cited_paper":"/paper/1906.11278","citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:1813cf9807b1c76b4b4130ad5bbd4432e3a525f51fe7aebb521d004a9f7f66bb","observation_id":"075806cd-5390-401e-901c-915b378b60ab","resolution":{"observed_at":"2026-08-14T06:07:19.310003Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1902.00167","last_updated":"2019-02-01T04:03:22Z","snapshot_observed_at":"2026-08-14T17:22:36.822940Z","submitted_at":"2019-02-01T04:03:22Z","title":"Private Secure Coded Computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.00167","snapshot_observed_at":"2026-08-14T06:07:19.184326Z","title":"Private secure coded computation,","venue":null,"work_id":null,"year":1902},"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":38,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.184326Z"},"links":{"cited_paper":"/paper/1902.00167","citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:443cef94b9b404eefea441a2e55a6c68c999e657b98fbab54ffae22552dd78a0","observation_id":"89c7f495-fe78-4527-b1d4-64aea4f49f71","resolution":{"observed_at":"2026-08-14T06:07:19.184326Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.10684","last_updated":"2019-06-25T17:59:10Z","snapshot_observed_at":"2026-08-02T10:59:14.959371Z","submitted_at":"2019-06-25T17:59:10Z","title":"On the Upload versus Download Cost for Secure and Private Matrix Multiplication","version":1},"cited_work":{"arxiv_id":"1906.10684","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.10684","snapshot_observed_at":"2026-08-14T06:07:19.270103Z","title":"On the Upload versus Download Cost for Secure and Private Matrix Multiplication","venue":"cs.IT","work_id":"da572cee-85cc-428a-8a8a-15ac499744d5","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":39,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.188492Z"},"links":{"cited_paper":"/paper/1906.10684","citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:f46814c7f699b8c64136319cf784ea07dd872da23d0599a1e95683994a5e0d17","observation_id":"19d75c7c-cf9f-4c04-9228-e3b1a7df3668","resolution":{"observed_at":"2026-08-14T06:07:19.274865Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01204","last_updated":"2020-03-08T01:56:07Z","snapshot_observed_at":"2026-08-15T04:09:42.784386Z","submitted_at":"2019-08-03T17:32:41Z","title":"Private Sequential Function Computation","version":2},"cited_work":{"arxiv_id":"1908.01204","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.01204","snapshot_observed_at":"2026-08-14T06:07:19.251409Z","title":"Private Sequential Function Computation","venue":"cs.IT","work_id":"d8c1cce1-0d5b-45ec-bec6-24f06ef653d8","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":40,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.193047Z"},"links":{"cited_paper":"/paper/1908.01204","citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:247b1270ad6f467a14cb707694999c5bb5e1433d0b39da3ae31ea405cc5c8e73","observation_id":"721a9494-3fde-4486-a821-493ae0f0bde4","resolution":{"observed_at":"2026-08-14T06:07:19.257655Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.543275Z","title":"How to share a secret,","venue":null,"work_id":"cbe047a5-5661-43b8-bf92-b06bd4e67a61","year":1979},"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":41,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.197624Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:bd6cb2f4b2f8cc25787f3fd10165a1efacc2d083b99c818a2f734d491c1330ad","observation_id":"b58ce0c8-4265-469a-b478-4b0a7b1ff546","resolution":{"observed_at":"2026-08-14T06:07:19.547067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.531065Z","title":"Kung, Fast evaluation and interpolation","venue":null,"work_id":"4a9fdf7e-053e-4c9c-8361-372c10082a8e","year":2009},"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":42,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.204823Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:090546c7d93dc62d3899e71d6b8315072dc5c86bc31bc9e36e979b51b70c0658","observation_id":"dc046e96-0fad-4dc7-93bf-4da25d967957","resolution":{"observed_at":"2026-08-14T06:07:19.535159Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.518861Z","title":"Speeding up distributed machine learning using codes,","venue":null,"work_id":"3f258669-2b20-423c-837e-1980a2d41dc6","year":2017},"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":43,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.210049Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:2b5a5761e496144cc005518f1b37422e7961728d8b4a7e27b668432d16c62b37","observation_id":"8732ae5e-91f2-4431-b3d0-1276aec06ea6","resolution":{"observed_at":"2026-08-14T06:07:19.523100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.504974Z","title":null,"venue":null,"work_id":"886b1015-23ec-4615-8f43-7e1ae8f60c1d","year":2014},"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":44,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.214310Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:ed162ba678d86b9dcd876a690311238707c8b75b2edbdb921fa515a572d81a2c","observation_id":"41e8e67f-768b-43f2-a308-49ed1ce86046","resolution":{"observed_at":"2026-08-14T06:07:19.510477Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:07:19.489819Z","title":"Coded federated computing in wireless networks with straggling devices and imperfect CSI,","venue":null,"work_id":"538c1eef-6e91-4391-9a28-bc3e5c05b6ba","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":45,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.218190Z"},"links":{"citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:b09abbdf6de75336e6120b658873c8902662343d178c0d1b79ec73be036377b4","observation_id":"5e63fa74-43dc-4f4f-abf5-c1c97661aa38","resolution":{"observed_at":"2026-08-14T06:07:19.495912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"1909.00407","last_updated":"2019-12-18T18:36:45Z","latest_version":2,"primary_category":"cs.IT","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"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":7,"verified_fuzzy":28},"total_outbound_references":45},"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 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:1909.00407."}