{"as_of":"2026-08-07T09:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2dd869a24e3df5cfe4aa3c1770268b0090c14b376cb89b350bd6b13ff605e5cc","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T09:37:11.113232Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2607.20739/citation-record","integrity":"/paper/2607.20739/integrity","json":"/paper/2607.20739/citation-record.json","paper":"/paper/2607.20739"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:06.675589Z","title":"Large scale distributed deep networks,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:06.675589Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:8c5827e3f14d3815613dd7ffa8f2440c28b13e42b8bbf1c69fa25c4e2bd4f262","observation_id":"789a2e5a-5f31-4c94-bf79-ccc62afeebda","resolution":{"observed_at":"2026-08-01T09:37:06.675589Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:06.819336Z","title":"Optimal Dis- tributed Online Prediction Using Mini-Batches,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:06.819336Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:9269bbc76dd1d8d2085b09a412338a49bf37418c292aba7487e8008a5e8efc1a","observation_id":"7c69e8ca-5e2b-4eee-b3b7-0c9fa2195ab2","resolution":{"observed_at":"2026-08-01T09:37:06.819336Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:06.971721Z","title":"Parallelized stochastic gradient descent,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:06.971721Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:23b77f5ffa8baf118481def9cfb814815556608ad2ea5add7ff31c2b35a67b6f","observation_id":"266c5acf-c6fb-4938-a15e-f1ec12bed5cc","resolution":{"observed_at":"2026-08-01T09:37:06.971721Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:07.084984Z","title":"Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:07.084984Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:99c8e2448b022a456cf6cc0ed07f5cb19bb49370d512d1df425747ecc1e17e97","observation_id":"afb93824-9d15-4114-bd88-2ba0ff3feee5","resolution":{"observed_at":"2026-08-01T09:37:07.084984Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:07.248403Z","title":"Speeding Up Distributed Machine Learning Using Codes,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:07.248403Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:3d68c457beba1ed8d8167a79e7dc74d41e6b20522c6f00f63382aa73a6ce559d","observation_id":"76c5dfe8-1531-437b-87de-c7bec923add8","resolution":{"observed_at":"2026-08-01T09:37:07.248403Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:07.360862Z","title":"Gradient Coding: Avoiding Stragglers in Distributed Learning,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:07.360862Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:f22ce65dda36f0875e56dd372454e255035c35397a7b85eb906552c75093d103","observation_id":"fa51f890-2199-4572-bf28-c9144f1c22a0","resolution":{"observed_at":"2026-08-01T09:37:07.360862Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:07.410121Z","title":"MapReduce: Simplified Data Processing on Large Clusters,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:07.410121Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:6885bf6052a3b178a12869d0f01ded205b7e0886be99092b74a4dd6a2b95d2cb","observation_id":"aa377d0c-cdbf-4447-b97b-f6009b1ab013","resolution":{"observed_at":"2026-08-01T09:37:07.410121Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:07.482215Z","title":"The Tail at Scale,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:07.482215Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:0d54d1a0cb9a8fa2a654ccabcb890f10d9ba793b166cdbaf68e22004aa07559e","observation_id":"fba3dbbb-c348-420a-9a38-1a62f5a1aff2","resolution":{"observed_at":"2026-08-01T09:37:07.482215Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:07.578017Z","title":"Communication effi- cient distributed machine learning with the parameter server,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:07.578017Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:489d3009630a776fcbff3aa829b52f1e342d66a6574e21e0bf5fdc086e8d1335","observation_id":"9b25477d-8ef4-49ba-bc8d-c695f9919329","resolution":{"observed_at":"2026-08-01T09:37:07.578017Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:07.618765Z","title":"Straggler-aware Distributed Learningw Communication–computation Latency Trade-off,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:07.618765Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:b25eab4570aa7d1b352e695a36299d83beadd572f59f744c3cd5ec4e2ccd3c78","observation_id":"1f7ac39b-091c-4dd6-9ca8-4fbd07adb3e6","resolution":{"observed_at":"2026-08-01T09:37:07.618765Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:07.737576Z","title":"Speeding Up Coded Distributed Machine Learning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:07.737576Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:29abf8f9c9e8ea44d80bce617c6e93514a76c8fbd68809266661c2331fdfa7d4","observation_id":"07575502-f582-4607-93ab-105a83df1015","resolution":{"observed_at":"2026-08-01T09:37:07.737576Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:07.824558Z","title":"Using straggler replication to reduce latency in large-scale parallel computing,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:07.824558Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:5a1921ec6cff8aaf67153dcad6222b78b466be15fa5236e7eba7af3770f21dee","observation_id":"5f22d12f-c8a4-4dd6-9870-3f4a2d3bc2b0","resolution":{"observed_at":"2026-08-01T09:37:07.824558Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:07.900853Z","title":"Efficient Straggler Replication in Large-scale Parallel Computing,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:07.900853Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:03b89f016b40b073a46233c270dc60fbc00e14bb4d2e66c1b873b4d2887aeee6","observation_id":"c281800d-3328-4e60-bdc1-1f7e145dcc85","resolution":{"observed_at":"2026-08-01T09:37:07.900853Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:07.989445Z","title":"Using Straggler Replication to Reduce Latency in Large-scale Parallel Computing,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:07.989445Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:813accd0f305901b92a3190d40d996320c8622380535bb79c232a6832879c6aa","observation_id":"a1995d9f-9f73-4e05-9da9-05b1e53edd91","resolution":{"observed_at":"2026-08-01T09:37:07.989445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:08.140329Z","title":"Improving speedup and response times by replicating parallel programs on a snow,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:08.140329Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:4a97a6329f0679d1b4036b5630217b8083e7a75ed62ac1f976124c4074c01fe2","observation_id":"dd81bd72-2dff-470a-913a-9237f716016c","resolution":{"observed_at":"2026-08-01T09:37:08.140329Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:08.260116Z","title":"Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding,","venue":null,"work_id":null,"year":1920},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:08.260116Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:16356796fa6a8b33c9a2d6c9b96714f0ba122225cb76bdd3a04f2c75bf1fd6ec","observation_id":"10de8625-48af-4867-b134-d9f70d020bf8","resolution":{"observed_at":"2026-08-01T09:37:08.260116Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:08.309982Z","title":"‘Short-Dot’: Computing Large Linear Transforms Distributedly Using Coded Short Dot Products,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:08.309982Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:a30b66836337ad5c484f0231822700766e1014711cd8eb5041c913a57017517e","observation_id":"0e4ead9b-c1ed-416f-80b9-9dbc6a7992eb","resolution":{"observed_at":"2026-08-01T09:37:08.309982Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:08.382639Z","title":"Dual Entangled Polynomial Code: Three- Dimensional Coding for Distributed Matrix Multiplication,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:08.382639Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:0a5357dec3ad35f9e84766678b17d20cdd19f2fa50f57aa4687644fed81ec960","observation_id":"1755ec24-f737-469a-b43f-dfe04eda4537","resolution":{"observed_at":"2026-08-01T09:37:08.382639Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:08.473290Z","title":"Local re-encoding for coded matrix multiplication,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:08.473290Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:8df487999da1794436a4bb4d8b4e4c4ad47973a0c0e55df64c3177fe33e135fc","observation_id":"361fae3d-cf5d-42d0-84cd-a6d346b87655","resolution":{"observed_at":"2026-08-01T09:37:08.473290Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:08.556478Z","title":"Anytime coding for distributed com- putation,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:08.556478Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:b38c59c4a6eee280e6b28ac69eeda1fb7c1e523b52054b57555294238b0eb1d7","observation_id":"e139e1c1-c689-49cc-a7ff-13e081d12059","resolution":{"observed_at":"2026-08-01T09:37:08.556478Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:08.610234Z","title":"Coded distributed computing for inverse problems,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:08.610234Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:66d44d52ef1199454baf5a05c63a3101cb191b8e9bb9c78c1db9a67781cb0e07","observation_id":"eba25645-6f51-4e28-8651-57664b721827","resolution":{"observed_at":"2026-08-01T09:37:08.610234Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:08.675980Z","title":"Coded Distributed Computing with Partial Recovery,","venue":null,"work_id":null,"year":1945},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:08.675980Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:a9aa5b83e145a2225707aa43c40699a83a3868a094329ff43ccaa8177d8b50d6","observation_id":"e2394a91-9a85-4b0a-b6fb-f03aa3812183","resolution":{"observed_at":"2026-08-01T09:37:08.675980Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:08.752399Z","title":"Rateless codes for near-perfect load balancing in distributed matrix-vector multiplication,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:08.752399Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:06851ad7e2e88f0cc64cb45d6df490d013b529afa134c263925826d3242ff871","observation_id":"6612b482-b943-4bd6-93ec-ed5350f87b1c","resolution":{"observed_at":"2026-08-01T09:37:08.752399Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:08.867252Z","title":"Improving Dis- tributed Gradient Descent Using Reed-Solomon Codes,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:08.867252Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:f7a9e47f99947d388259f16443f13e262c91de660bb5e05d1312f032bc5a815e","observation_id":"d78d3705-b0a2-4bb5-b395-76bdaac6cc36","resolution":{"observed_at":"2026-08-01T09:37:08.867252Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:08.951036Z","title":"Communication-computation Efficient Gradient Coding,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:08.951036Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:76af9e960b09960acc1debd580f550b2e0c0f5260f220d2bae2c2143f905682b","observation_id":"5835bc45-8037-4079-97d1-96ffb8b83507","resolution":{"observed_at":"2026-08-01T09:37:08.951036Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:09.056667Z","title":"Speeding up distributed gradient descent by utilizing non-persistent stragglers,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:09.056667Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:56c7748346a0e875ba0de54c36bfcd5a3eff4b862c0047d4abbaebee137d92e2","observation_id":"e10b2ea6-7a86-4c27-a2d4-9fc8f7195af4","resolution":{"observed_at":"2026-08-01T09:37:09.056667Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:09.182227Z","title":"Distributed Gradient Descent with Coded Partial Gradient Computations,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:09.182227Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:0f62b9bd9fffd4b3e8e517e02fc17ec750ba76cfb3679720cbcf1e073f97b6c4","observation_id":"aa8679eb-ef74-436b-8932-76a9eb8ff7b5","resolution":{"observed_at":"2026-08-01T09:37:09.182227Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:09.280375Z","title":"Heterogeneity-aware Gradient Coding for Tolerating and Leveraging Stragglers,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:09.280375Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:3a67537a538ece61cfdd6647ffd29adb8ed33088a0d3056d472923a3318fd95e","observation_id":"1421c9db-ee56-4916-9d9a-0f2797d221aa","resolution":{"observed_at":"2026-08-01T09:37:09.280375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.13802","last_updated":"2023-06-28T14:42:36Z","snapshot_observed_at":"2026-08-05T07:34:46.913783Z","submitted_at":"2022-11-24T21:12:49Z","title":"Sequential Gradient Coding For Straggler Mitigation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.13802","snapshot_observed_at":"2026-08-01T09:37:09.354075Z","title":"Sequential Gradient Coding for Straggler Mitigation,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:09.354075Z"},"links":{"cited_paper":"/paper/2211.13802","citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:6ca3ac111e0cb016bd993118857d5333682feac65d0b8289fd2f0ab6e2a6da52","observation_id":"e0ffbc9c-2d99-4fab-bc36-1aacc61b86a7","resolution":{"observed_at":"2026-08-01T09:37:09.354075Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:09.439855Z","title":"Distributed gradient descent with coded partial gradient computations,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:09.439855Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:34e5ee6caddeeed55c42d1d97153b51b0bff16109bf3985bba896cd04f56a264","observation_id":"b510b9be-5f05-4cfb-9d5b-a903e5ae98cb","resolution":{"observed_at":"2026-08-01T09:37:09.439855Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:09.553690Z","title":"Slow and stale gradients can win the race: Error-runtime trade-offs in distributed sgd,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:09.553690Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:944b710ed04d2000b8e75bd3edddbb1cfeb2d578f54a4eb7918bdaf722570ffa","observation_id":"f7941b2e-026a-446e-b9c4-f9178039998c","resolution":{"observed_at":"2026-08-01T09:37:09.553690Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:09.695619Z","title":"Adaptive distributed stochastic gradient descent for minimizing delay in the presence of stragglers,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:09.695619Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:0c661febf5880fb061d6ebb85fd70ca47277e7cbdf20b857762a9caede572852","observation_id":"1ddcfcf9-b588-4b3e-b7db-7ec1a14125a6","resolution":{"observed_at":"2026-08-01T09:37:09.695619Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1604.00981","last_updated":"2017-03-21T07:44:39Z","snapshot_observed_at":"2026-07-06T04:51:42.448272Z","submitted_at":"2016-04-04T18:40:05Z","title":"Revisiting Distributed Synchronous SGD","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.00981","snapshot_observed_at":"2026-08-01T09:37:09.870651Z","title":"Revisiting distributed synchronous sgd,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:09.870651Z"},"links":{"cited_paper":"/paper/1604.00981","citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:bd7dfcb78189f6c463b1523838ad07d6012e3c8158f9e5a22ab9f678891b95b1","observation_id":"cd2a10c3-8e39-400d-abc4-6f5745ca1fc3","resolution":{"observed_at":"2026-08-01T09:37:09.870651Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:10.033386Z","title":"Fundamental Limits of Approximate Gradient Coding,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:10.033386Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:acaa088a0df44f68e11d37ff339cf02f7557094f7a7b98781464e256f29fa7f9","observation_id":"885cba16-59c9-404d-877b-4367fca44382","resolution":{"observed_at":"2026-08-01T09:37:10.033386Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.06771","last_updated":"2017-11-17T23:19:30Z","snapshot_observed_at":"2026-07-06T06:10:06.376505Z","submitted_at":"2017-11-17T23:19:30Z","title":"Approximate Gradient Coding via Sparse Random Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.06771","snapshot_observed_at":"2026-08-01T09:37:10.171488Z","title":"Approximate gradient coding via sparse random graphs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:10.171488Z"},"links":{"cited_paper":"/paper/1711.06771","citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:27a2b1761876ad3388446eac38ed191bf51a396e867631d048db11b6ecb8c0cf","observation_id":"f784ff92-dedc-45e6-bc04-cab8b828f319","resolution":{"observed_at":"2026-08-01T09:37:10.171488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.09671","last_updated":"2019-01-28T14:21:32Z","snapshot_observed_at":"2026-07-06T07:29:25.620611Z","submitted_at":"2019-01-28T14:21:32Z","title":"ErasureHead: Distributed Gradient Descent without Delays Using Approximate Gradient Coding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.09671","snapshot_observed_at":"2026-08-01T09:37:10.222846Z","title":"Erasurehead: Distributed gradient descent without delays using approximate gradient coding,","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:10.222846Z"},"links":{"cited_paper":"/paper/1901.09671","citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:e23d8781e8e68e3dc048c2ad83465ad102328a6f661fba0d65c44f5474f2a430","observation_id":"be85424f-a0d9-4f62-9867-5fff9907310b","resolution":{"observed_at":"2026-08-01T09:37:10.222846Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:10.294238Z","title":"Stochastic Gradient Coding for Straggler Mitigation in Distributed Learning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:10.294238Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:c221cbb7f58acb5f1ceffe2365779a008b2dafc2e25c4eae3c86fb7047c9bed5","observation_id":"29dc0027-ab5a-4622-b9fb-7d39f90f2fd9","resolution":{"observed_at":"2026-08-01T09:37:10.294238Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:10.389143Z","title":"Gradient Coding from Cyclic MDS Codes and Expander Graphs,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:10.389143Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:7caedd50e232cac6a96531d234227965ab2926a73b556402910dd3c0a7f92d90","observation_id":"4cb7b0e4-b77c-472d-a476-f0cf60b9616b","resolution":{"observed_at":"2026-08-01T09:37:10.389143Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:10.503908Z","title":"On Arbitrary Ignorance of Stragglers with Gradient Coding,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:10.503908Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:cc3ea3172ce9d991f4593af526b25b337d2b04149abdaf99d2e18f7227141864","observation_id":"6fcca797-9c28-4741-8500-30e2c779076b","resolution":{"observed_at":"2026-08-01T09:37:10.503908Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:10.654343Z","title":"Deep residual learning for image recognition,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:10.654343Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:12a97251ebb128de3ebc3022b2d3ca88ba21d3097827251cc4a94c6f787bbe94","observation_id":"9cc43251-fafe-40d0-9df9-e623aa11934a","resolution":{"observed_at":"2026-08-01T09:37:10.654343Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:10.762309Z","title":"Learning multiple layers of features from tiny images,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:10.762309Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:0225f8ee428a558c8e1da726c065022743c0fe5f39aac7f40a09d07333670f7a","observation_id":"593c19d1-ffb7-48a7-b014-695fde48d90a","resolution":{"observed_at":"2026-08-01T09:37:10.762309Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:10.878480Z","title":"Anyscale - Ray Distributed Computing - Anyscale","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:10.878480Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:e8c26d5152f538a3806d0ba82e8ed5de21b5ecaf4e8d0cb1afec51579bb30bc3","observation_id":"0d9c7a3f-03b3-4e27-9c2f-1fcb81d34137","resolution":{"observed_at":"2026-08-01T09:37:10.878480Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.08819","last_updated":"2017-08-23T16:06:20Z","snapshot_observed_at":"2026-07-06T05:52:59.445968Z","submitted_at":"2017-07-27T11:22:22Z","title":"A Downsampled Variant of ImageNet as an Alternative to the CIFAR datasets","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.08819","snapshot_observed_at":"2026-08-01T09:37:10.995761Z","title":"A downsampled variant of imagenet as an alternative to the cifar datasets,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:10.995761Z"},"links":{"cited_paper":"/paper/1707.08819","citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:18431ef4990270c44c4996752f8b57021e38b6afb3ed5629dadfdf7b6feb9d8d","observation_id":"a546f408-ecaa-433d-acae-7c80a7c07bc8","resolution":{"observed_at":"2026-08-01T09:37:10.995761Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:37:11.113232Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:11.113232Z"},"links":{"citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:03baadb9a20cb8339f5b6f97673d97e22ce82bc35b877b751b8ef6397c51f1e2","observation_id":"d0116138-592d-4f51-91c7-e63cb0aee47c","resolution":{"observed_at":"2026-08-01T09:37:11.113232Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":44,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":44},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2607.20739."}