{"as_of":"2026-08-16T10:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d70b46c40d25b587ac7347b1380a4fef1e6f6c4e82bcc987f4019187c0fb17e3","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:18:49.873338Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.01527/citation-record","integrity":"/paper/1908.01527/integrity","json":"/paper/1908.01527/citation-record.json","paper":"/paper/1908.01527"},"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-14T15:18:52.030266Z","title":"https://github.com/facebookarchive/hadoop-20, Retrieved in November 2020","venue":null,"work_id":"2c7b270e-e0d2-45fa-b9f3-60d8e2c57813","year":2020},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:48.676147Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:b217bbde6df7e2751fbec16da9ecf3967912b7476ba92486207d7afd4168411b","observation_id":"c0cd99db-ccc8-4e38-a327-db5f3b0e6d1d","resolution":{"observed_at":"2026-08-14T15:18:52.035052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:52.014295Z","title":"https://hadoop.apache.org/docs/r3.1.1/, Retrieved in Novem- ber 2020","venue":null,"work_id":"f515dc39-2c59-47cf-a16a-5b7caaa6104e","year":2020},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:48.722983Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:3a8abcdae3067175fd7cb2315c1c2f1a71dad61e5d162ea9007762081d409f6d","observation_id":"379fb612-0273-43c5-b00a-788604f6ff38","resolution":{"observed_at":"2026-08-14T15:18:52.020187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.996777Z","title":"https://iperf.fr/, Retrieved in November 2020","venue":null,"work_id":"c6664a1f-79b4-4244-8735-18fd5f9c0b3f","year":2020},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:48.729031Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:aaa2fab2e0ed66267290a7a72239f7623e5970bc3b7196348d4323f77060252f","observation_id":"387aaf6d-464d-4e4a-bb53-402d399caff1","resolution":{"observed_at":"2026-08-14T15:18:52.002420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.982052Z","title":"http://redis.io/, Retrieved in November 2020","venue":null,"work_id":"e28987ba-184a-4ccb-a7e1-e7b6724f752d","year":2020},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:48.734064Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:5b270d59c8ae45397da9f808546be689df2e2d009779f77dfa15235f377c7c97","observation_id":"be1ed726-3f52-44c6-9c2f-7ca89a24d885","resolution":{"observed_at":"2026-08-14T15:18:51.986335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.965415Z","title":"https://linux.die.net/man/8/tc, Retrieved in November 2020","venue":null,"work_id":"cb5327ef-5bbd-4c90-9608-63036777837e","year":2020},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:48.739217Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:2cd0f0f89a6d8fb068a242ae14001aba2564b4c9dcf44698449c37f328c51e19","observation_id":"93ed9cce-7514-41f8-a3f2-d3fd7d39fa60","resolution":{"observed_at":"2026-08-14T15:18:51.971954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.951184Z","title":null,"venue":null,"work_id":"78dc278e-fbe2-4f84-881c-569ae6a4265e","year":2013},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:48.744005Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:17d0e728fd01068dfe8ed6a49d75b2b4550e11ea2171122241df97051fa2d0e2","observation_id":"30e413bb-4dff-4b28-aab7-54a49681bd10","resolution":{"observed_at":"2026-08-14T15:18:51.955610Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.936191Z","title":"Ahmad, S","venue":null,"work_id":"ffaa32e7-337a-400d-ad8d-8788c9617fc5","year":2014},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:48.749798Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:b7746c023a4dd16f1b6d35f2e26b992c96807220b16874cfebff74bfd24a47a4","observation_id":"6185e26e-d767-46d5-b888-db00a7f1dc65","resolution":{"observed_at":"2026-08-14T15:18:51.941009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.919978Z","title":"Andr´e, A.-M","venue":null,"work_id":"c8544a5d-9272-4bcd-b540-f7b67978c778","year":2014},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:48.754530Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:144ac0e85a0fe5591509c1d5b032cabf5a61d12c36b071d0a6f3e2cb3628df0a","observation_id":"6c26446a-0e8e-4aa4-9bdf-c4b76b6c4da0","resolution":{"observed_at":"2026-08-14T15:18:51.925975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.905209Z","title":null,"venue":null,"work_id":"4dfc55f9-b74a-4d0b-8dda-f38d300fe038","year":2019},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:48.759258Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:0cd66dd3a0628f4fe7f03a94a8c99c7f6a00a6b789a3329e9349eaf2f90e664f","observation_id":"fc70f12f-016a-4c05-8ff8-b878f219b933","resolution":{"observed_at":"2026-08-14T15:18:51.909805Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.888124Z","title":"Bhagwan, K","venue":null,"work_id":"6a81a2e8-778f-4004-b3bc-57b53d08fcd1","year":2004},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:48.763450Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:0ebbaa0b4c6f8d39c38a3130b8d515bdbcb6e81f99d07b3c565b45835a0b0491","observation_id":"744fa3d3-e2f4-419b-bed7-5437d110c1f4","resolution":{"observed_at":"2026-08-14T15:18:51.893767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.872432Z","title":"Calder, J","venue":null,"work_id":"40962155-2945-4e5a-b254-52fc9787a807","year":2011},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:48.767963Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:e8d881e92dce7ed5ad2e110a036e56bbbc26a9f15adc2091c355032396c741ad","observation_id":"8e93d7dc-3f0d-4279-8ab3-2d2e12a36a70","resolution":{"observed_at":"2026-08-14T15:18:51.877808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.857306Z","title":null,"venue":null,"work_id":"0aaa9da8-3323-4cc7-9008-d84951b7642e","year":2017},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:48.828177Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:aeb06aed47b9c41773f84b4873e6e0a9aae581b491483a1e34c6e6e30e19ac6d","observation_id":"932e563b-9461-415e-a387-04e34612add8","resolution":{"observed_at":"2026-08-14T15:18:51.862719Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.841397Z","title":"Chowdhury, S","venue":null,"work_id":"9082f7bc-7afd-405c-a190-57a8af7d21e7","year":2013},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:48.925633Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:7007248ab57a283377e559d6d370de389c3996137b4e47cbab4607753c3639b9","observation_id":"f4499cfc-2016-4fca-8147-26695ee9e279","resolution":{"observed_at":"2026-08-14T15:18:51.847110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.827509Z","title":null,"venue":null,"work_id":"f506e500-a8ba-448d-baa2-d0f07fa75b6d","year":2006},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.008560Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:b221e6ff19a4510c666999278b1d58a2752e2ba9ae428db612938fef43010415","observation_id":"653182e7-b183-431c-9551-02056d3ebdfe","resolution":{"observed_at":"2026-08-14T15:18:51.831980Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.812431Z","title":"Dean and S","venue":null,"work_id":"73ac12b7-2f5d-41bd-b2d0-ba6debd1485d","year":2004},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.013650Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:d8b1fbe1a1383926e2f58f5b839013c511de1fc2d25e8c47cd9d102c36c22ce3","observation_id":"13f16c47-5bc5-419c-ac31-bee6737ec865","resolution":{"observed_at":"2026-08-14T15:18:51.817614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.798188Z","title":null,"venue":null,"work_id":"1c6de496-9248-4049-9326-1237cfa67839","year":2010},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.018048Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:f0a7b32bc8f0c916a7fa17f849402e16f21f950aaa736f4711cf4820587280ca","observation_id":"a3bd187e-8b00-4f14-8bfd-e9d589e8f568","resolution":{"observed_at":"2026-08-14T15:18:51.802733Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.784217Z","title":null,"venue":null,"work_id":"54cc7f63-835b-4f41-81d7-ba7636197700","year":2010},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.023786Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:9c21ee44766e7a971fa00844f6c59483a4c3f24c1bd853f182e89948142eda42","observation_id":"6a6411bc-eaa0-4381-a87c-3d08acf3c606","resolution":{"observed_at":"2026-08-14T15:18:51.788532Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.769999Z","title":"Ghemawat, H","venue":null,"work_id":"7e6948cd-c7f5-4869-b6d3-cbdc5cc776bd","year":2003},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.028820Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:f7b5c65b5df7c865eb1789f4901df9a5598a33790f8966c493dbf7be85bc8e47","observation_id":"603fcf8f-f34b-4a9a-939d-3be8e9a6b73f","resolution":{"observed_at":"2026-08-14T15:18:51.774719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.754660Z","title":null,"venue":null,"work_id":"25e600bc-5d17-430f-93f5-6a2061a7756e","year":1961},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.033519Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:c433e52515f33391d7e1660df9099b2669d2bc01ac0b76a81e0c70b9796c8834","observation_id":"394b02b3-78cc-40d2-b6b6-20dc289e1933","resolution":{"observed_at":"2026-08-14T15:18:51.759137Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.739965Z","title":"Holland and G","venue":null,"work_id":"6eb1bdcc-05fc-4121-98c5-9af6ec13889e","year":1992},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.131126Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:b6a96499d77821d27bbb97a75b58eb9610048c2b55288777b0e292f4f541c91c","observation_id":"4033e5cf-b9eb-429f-af2b-7685483783b3","resolution":{"observed_at":"2026-08-14T15:18:51.744637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.724972Z","title":null,"venue":null,"work_id":"20f53cd8-c9a8-439f-8112-6e8d8b0db5f6","year":2019},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.201183Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:d927f6e8517342fa06bf4e7edd1c6b0c1db9d572f4f767b228a71682d5dbec50","observation_id":"ccf5a76b-02fc-42ee-9a1a-037d4660b1df","resolution":{"observed_at":"2026-08-14T15:18:51.729847Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.711055Z","title":null,"venue":null,"work_id":"8112cd29-e9fc-4201-a1e3-83ae2579f04c","year":2017},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.206292Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:eb403bd4ee869d3ead49ed1bc234ba07ad14b564a7a489f921d6f00a8c09f6f2","observation_id":"3339fa25-7560-4b15-9133-a3b984ea6bff","resolution":{"observed_at":"2026-08-14T15:18:51.715063Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.695362Z","title":"Huang, H","venue":null,"work_id":"50e244c1-ab57-43ab-9604-0f1ecaf11dd7","year":2012},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.211151Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:b56bfeccd3577ccc422995ba559a6daea20fe53ce77190163a1dea4e6e941cb6","observation_id":"282e086d-9c42-4045-9b73-2dd70a344d16","resolution":{"observed_at":"2026-08-14T15:18:51.700545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.678035Z","title":"Huang, X","venue":null,"work_id":"c953bd62-3c2d-42f5-b0c7-6adb8d3e2bde","year":2015},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.215865Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:128c01a15dd51aa0a0233b203d1e858ba1fbbc859c1df6c136dc924a96ff415d","observation_id":"e2604c8c-6382-42cd-98dc-5483b245deda","resolution":{"observed_at":"2026-08-14T15:18:51.683470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.659657Z","title":"Jalaparti, P","venue":null,"work_id":"8f74df85-b2f7-464a-897c-88c71aace092","year":2015},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.219789Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:43cbad67091c56abc80cdf84ef0ee8c209ac93e6d6fcd9322379e30e2575f3d0","observation_id":"1fa3e072-9234-4011-a4ae-53ccca8b8bda","resolution":{"observed_at":"2026-08-14T15:18:51.666205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.638966Z","title":null,"venue":null,"work_id":"dd694260-237d-49bd-93a2-02a88dd3409a","year":2012},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.278017Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:cc2d01256cff9e620b311d4929a4873e36d11b45da4b6fe4b8ef9e14d0a75543","observation_id":"ffc4a781-9892-416a-be10-f102ae19435c","resolution":{"observed_at":"2026-08-14T15:18:51.645635Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.618292Z","title":null,"venue":null,"work_id":"4c6ef840-c9a8-4cbe-ba77-106ec24b955c","year":2010},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.341628Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:bcbc14876829ba9a6ecec98d151a8ac1d4386c354c030b2509a79a9aea4a5b5e","observation_id":"27a0b554-5852-4303-abb3-e413bd4da005","resolution":{"observed_at":"2026-08-14T15:18:51.625036Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.596048Z","title":null,"venue":null,"work_id":"c2360105-9f2f-486f-9fef-1e0ee7a8b44c","year":2014},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.379561Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:fb553f8c16f85623108552a983e1935cb63bbea40d5fd1c17a22a03a0657c48d","observation_id":"2657e3c7-bf07-452c-b2de-fabc7be75594","resolution":{"observed_at":"2026-08-14T15:18:51.601685Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.576693Z","title":null,"venue":null,"work_id":"f8a43360-9063-46cb-bdfc-e05ea14bd45a","year":2017},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.384951Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:a121a18e6e9690014cc4bcec4dabe594d4e7ee5b2176629652e1cc17b46a171c","observation_id":"66d952f2-5bfc-48e4-93fd-aeba94c66c40","resolution":{"observed_at":"2026-08-14T15:18:51.583864Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.530060Z","title":null,"venue":null,"work_id":"54f6fc56-5577-4e6f-a059-a889fd3f1cc2","year":2019},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.391269Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:e8e74358f3dd64a88b748d720f2bec022aded7eeee005935e3e2ac8c7f038f6a","observation_id":"5a764123-eef6-43b6-9497-0f0d22b2198a","resolution":{"observed_at":"2026-08-14T15:18:51.564193Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.511699Z","title":"Mitra, R","venue":null,"work_id":"0411d4b0-4217-4134-bfaf-aec9f28098d6","year":2016},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.396784Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:4190919b759ca7bd506d859db8cd5bb9524df1fe9c088b8addc4af45cc0d9ed8","observation_id":"cd8c7379-f37b-4bcf-8df1-1d2df6ecae6e","resolution":{"observed_at":"2026-08-14T15:18:51.518219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.408075Z","title":"Muralidhar, W","venue":null,"work_id":"a667876b-0f0c-4dfb-9ad0-d57afebabd73","year":2014},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.401358Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:c594d96e696f43b4722c5557e86d78af33b3021124d6b6058974a230be544853","observation_id":"f6e875a0-8396-4c8b-bd09-c06aa6b7de8c","resolution":{"observed_at":"2026-08-14T15:18:51.500048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.389200Z","title":null,"venue":null,"work_id":"3d423338-ff9e-4495-8848-026125d4ad1b","year":1993},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.406707Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:ef8dd812dd4ef02f9796e806f621ff29c28dcc684590fcee4d922d808ce99416","observation_id":"d6764360-cd30-4ce6-904e-3f5f6eb13741","resolution":{"observed_at":"2026-08-14T15:18:51.395741Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.295797Z","title":"Ongaro, S","venue":null,"work_id":"4a682cee-9a17-4e1d-9044-ff0311dd1531","year":2011},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.411470Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:243eead6c79c25d8735acfd0feaffa81e836f533b35d30099d3d63f7241b6274","observation_id":"8496cce3-d054-48f4-9ad8-cb93548055ba","resolution":{"observed_at":"2026-08-14T15:18:51.378272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.249584Z","title":"Ovsiannikov, S","venue":null,"work_id":"db3e0383-15b1-48e6-8815-f8e370c6a2d9","year":2013},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.463772Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:6a1238c50480e61f8fb8e136b72ccba9cee4ce176863cd710cbeda30454817d6","observation_id":"c271ae32-5c21-4d5d-9e01-d97a647fbea0","resolution":{"observed_at":"2026-08-14T15:18:51.254258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.232258Z","title":"Pamies-Juarez, F","venue":null,"work_id":"f685c068-2d13-4a0f-833e-87bb342b13f9","year":2016},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.509572Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:9ad47ac5a456a2299733b6d112edcd61cd7aa7195b29610c05bf3ad893d3f22d","observation_id":"b05dca16-9586-485c-8057-42e715128535","resolution":{"observed_at":"2026-08-14T15:18:51.237536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.062999Z","title":null,"venue":null,"work_id":"1e094dfc-cd57-4c45-a346-9ca29e50943d","year":2013},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.515560Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:6c7076f2a35fec958c687a04c40be931614cc1974b79d9132bd5483f1a0534f2","observation_id":"bdac8e01-8e64-4995-ba9d-8e96e9bfdb33","resolution":{"observed_at":"2026-08-14T15:18:51.164857Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.047528Z","title":null,"venue":null,"work_id":"f0deb46e-dd61-4f5d-84bb-8f6d30eb2293","year":2009},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.520987Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:895792652633215c45904846060a73c951c0698d0aa0236f55a2a8473146b898","observation_id":"08c74f24-d0ca-44de-b625-c31db276342b","resolution":{"observed_at":"2026-08-14T15:18:51.052155Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:51.000887Z","title":"Prakash, V","venue":null,"work_id":"26a7816f-8487-404d-92b9-2aacf07b3d09","year":2018},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.526810Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:721795d0034b28bd2c859ed9df93e3a1e77b8f9a7198a1acb88cc7376dddf9b0","observation_id":"aa8fd236-763b-4fda-99e5-e4e155489480","resolution":{"observed_at":"2026-08-14T15:18:51.035723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:50.799105Z","title":null,"venue":null,"work_id":"bec2c8ad-d239-4c09-86f5-9763952b4673","year":2015},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.530967Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:ca88bca6109cb1f75ce72a9124da2c16ed51e212542dcfffcc05acf1aa0aeffc","observation_id":"0b3ea6aa-fdf0-4918-918e-c593e13d274b","resolution":{"observed_at":"2026-08-14T15:18:50.863210Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:50.783869Z","title":null,"venue":null,"work_id":"b37b7ec6-f896-4682-9201-ec8d38f88fdc","year":2013},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.535390Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:540ed7f897454f2639508af2e226547ee8cded495162710d7106111bc296b3eb","observation_id":"8a348ac9-f45f-4acf-9c8a-5c0d6d8707a0","resolution":{"observed_at":"2026-08-14T15:18:50.788663Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:50.685797Z","title":null,"venue":null,"work_id":"30d4c5c0-3679-445e-a7a1-7fa3c1bdcadb","year":2014},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.539609Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:a363e1e2a33dfb98e6dedb9f093ed8d355bedd6ffb8cd9f7238bb86c02dda235","observation_id":"5096a488-a966-4f83-a9f1-46e1014a99d0","resolution":{"observed_at":"2026-08-14T15:18:50.773017Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:50.611553Z","title":"Reed and G","venue":null,"work_id":"2f87d8a9-b46a-491f-a7c9-7674e74785f5","year":1960},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.582622Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:4870c61926927d34483b9c1247a5707025e49c5e46ae9c889c58d71d446bf73c","observation_id":"a38bb424-b357-49cc-9485-4c3fb99a82f8","resolution":{"observed_at":"2026-08-14T15:18:50.616120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:50.594419Z","title":null,"venue":null,"work_id":"106d73ee-7a23-4774-ada3-23bcd2831716","year":2011},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.614956Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:04d00742b41af289652492a77bc57e0d5448e3ecdbd700d77f30675505858ebf","observation_id":"cca445d7-af65-46f2-a260-0cbd082f24c0","resolution":{"observed_at":"2026-08-14T15:18:50.599643Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:50.446965Z","title":"Sathiamoorthy, M","venue":null,"work_id":"e0391dde-492e-4990-a1c2-78450d529aab","year":2013},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.621586Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:8d4d903ead289b9be7bfb0076668ec2a0faf5e4a672aac5a3aafbc7ec591f8d7","observation_id":"a66d3c15-df0c-459e-b3dd-46e594377407","resolution":{"observed_at":"2026-08-14T15:18:50.528192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:50.391337Z","title":null,"venue":null,"work_id":"751b045c-cc93-4508-ab22-9572a074e7de","year":2019},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.626257Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:ae963457398138d16f2566210aad1fef0e9933453e3cb1e42f4e3914870ff0fd","observation_id":"96af30c5-c8b0-472b-ae9a-6f2dfcb921fe","resolution":{"observed_at":"2026-08-14T15:18:50.395787Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:50.375727Z","title":null,"venue":null,"work_id":"3192f169-ed53-458c-b6cb-7748c76ebd12","year":2020},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.630846Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:ff417c216caf7e88f5533b50e7e01dc8f9b41d43a8275e5a4157a784f611ac9f","observation_id":"c97b82a4-1bce-48d3-9d9c-f9855d14a1a1","resolution":{"observed_at":"2026-08-14T15:18:50.381030Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:50.186352Z","title":null,"venue":null,"work_id":"ca563fb3-3e41-4a87-b1a6-8df843582c2e","year":2016},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.635294Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:a4159cb0b29d71c7ff0d00458cf39367677a038accfc76ac6d81b622f9e4eb43","observation_id":"4685049b-d9c4-45ad-bb06-b9de5096ac6a","resolution":{"observed_at":"2026-08-14T15:18:50.260070Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:50.168853Z","title":"Shvachko, H","venue":null,"work_id":"79bf2cd8-2249-45b7-bee8-330d6f65c964","year":2010},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.727022Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:f9a2c187e73e7d7c446d3e32c33d266ce0538889adce33c02c691d40d0c61d03","observation_id":"d8ff2d12-b3be-44e9-9150-c4c4237340e7","resolution":{"observed_at":"2026-08-14T15:18:50.174167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:50.154133Z","title":"Silberstein, L","venue":null,"work_id":"7d117e31-b99f-4d96-b88e-8c600bff25ee","year":2014},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.854525Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:afb3db2a0b081465a1a9992481141ad82445a85e8c3b4d89399af99cd051ea32","observation_id":"af0847f1-920a-40dd-8706-e8893f4c6f6b","resolution":{"observed_at":"2026-08-14T15:18:50.158785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:50.038327Z","title":"Vajha, V","venue":null,"work_id":"f90018e7-579d-4534-a902-fbffe2664b26","year":2018},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.859624Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:66a506ddca98d23b85fb502c842e3a9a4ded703061e28df9c46e6d82a80bd64b","observation_id":"40c049db-713b-4667-93d2-bda659363a18","resolution":{"observed_at":"2026-08-14T15:18:50.143256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:50.023069Z","title":"Weatherspoon and J","venue":null,"work_id":"448d1799-107e-4237-8783-09148764b452","year":2002},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.864379Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:2e5ef4e6c8ac9a12067337176fc28b6915c443683c1d5dc8e2e657761fe67c22","observation_id":"e0456268-c9e1-4f63-ac9a-754f1dbc3b90","resolution":{"observed_at":"2026-08-14T15:18:50.027787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:49.905247Z","title":null,"venue":null,"work_id":"98447bfc-1a49-469a-af3c-d121c9b01cc7","year":2019},"citing_paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:49.873338Z"},"links":{"citing_paper":"/paper/1908.01527"},"observation_digest":"sha256:af47c4a074ac8187bcc24d4f770ec52e5062089cf25b07a5435871a55abd80bf","observation_id":"03e72158-e942-4813-a3b9-585f97d79f5f","resolution":{"observed_at":"2026-08-14T15:18:50.011430Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.01527","last_updated":"2020-11-20T08:22:31Z","latest_version":3,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-16T05:34:25.832835Z","submitted_at":"2019-08-05T09:13:43Z","title":"Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":25,"verified_exact":0,"verified_fuzzy":28},"total_outbound_references":53},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:1908.01527."}