{"as_of":"2026-08-13T14:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5cc7ef06d8b7736692ee6412bcb4f266be8d3db915fc729c98368d9f788e7a3b","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T14:46:55.247726Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2411.14980/citation-record","integrity":"/paper/2411.14980/integrity","json":"/paper/2411.14980/citation-record.json","paper":"/paper/2411.14980"},"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-12T14:46:55.461714Z","title":"The tail at scale,","venue":null,"work_id":"f31ff9cb-a194-4f78-8cd0-ef87a105e27c","year":2013},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.180011Z"},"links":{"citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:994b68d32281c9cb77f72b45078ede3d619112ef754f6ccab0e8a814e7c99c95","observation_id":"a3727270-7fa0-466b-be8a-2c430a8e231a","resolution":{"observed_at":"2026-08-12T14:46:55.465513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:46:55.450813Z","title":"Speeding up distributed machine learning using codes,","venue":null,"work_id":"8ee3e8ae-1346-442d-8102-a974f9d8baa9","year":2017},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.183918Z"},"links":{"citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:6a782152113e22ffe70ce739127e58590a02cafb6b86089df7f48d93dcb7ba73","observation_id":"cb90ae3b-6875-415e-8303-e90641be7789","resolution":{"observed_at":"2026-08-12T14:46:55.454405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:46:55.440113Z","title":"High-dimensional coded matrix multiplication,","venue":null,"work_id":"269e169d-ce85-4d61-bdc8-9b6045328c2c","year":2017},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.187605Z"},"links":{"citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:c48c93b89b47552dff53a665aefc65b966810a3cf6c08f3ae54a9715bb78ca80","observation_id":"3210887b-fbfa-4a48-834a-cba03b95a7e1","resolution":{"observed_at":"2026-08-12T14:46:55.443468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:46:55.430195Z","title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication,","venue":null,"work_id":"d7e3cbd2-3a8b-40f4-995c-dfeced06c315","year":2017},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.191319Z"},"links":{"citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:a9d4708c4deebff6e4bac09996d66c220763017a6f36d31baf989da684006525","observation_id":"d5974210-cbfa-4865-8ffa-4ecdc57fbb0d","resolution":{"observed_at":"2026-08-12T14:46:55.433529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:46:55.420239Z","title":"Straggler mitigation in distributed matrix multiplication: Funda- mental limits and optimal coding,","venue":null,"work_id":"21bed871-b4e2-420d-937f-fe6541245ce3","year":1920},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.195113Z"},"links":{"citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:db962997e2e4e571985503452c164b764c98757a95ea9249fa0ce811c08301dd","observation_id":"fac01679-a2af-42e7-9462-177d947a99f0","resolution":{"observed_at":"2026-08-12T14:46:55.423455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:46:55.409703Z","title":"On the optimal recovery threshold of coded matrix multiplication,","venue":null,"work_id":"e078b2ea-5f10-49ba-a32e-946c2c00629a","year":2019},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.199116Z"},"links":{"citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:2682ede36c82a403ab30e6bf884d5e553402374f2c675662c371875308565423","observation_id":"0f6eee70-30b1-4e01-9725-f39b8c7dcffd","resolution":{"observed_at":"2026-08-12T14:46:55.413357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:46:55.399673Z","title":"On the capacity of secure distributed matrix multiplication,","venue":null,"work_id":"51d5b856-6e10-4669-8f0c-3d6f9f7623d2","year":2018},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.205233Z"},"links":{"citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:b591c865c94207540841a7a9b45d4f5ca785a8013feca50558ae89e0540ee222","observation_id":"384dad25-80fc-425a-908a-2157b254fbf4","resolution":{"observed_at":"2026-08-12T14:46:55.403328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:46:55.389533Z","title":"Gasp codes for secure distributed matrix multiplication,","venue":null,"work_id":"80ad5418-4d97-49a3-a018-2380ca220712","year":2020},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.210027Z"},"links":{"citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:abb1c48ac35dd56bbc6e0356708e1eb0b42ca86b6703dde2554e52d15abc76f8","observation_id":"96309b5a-3012-4585-869f-dae70b88bc4f","resolution":{"observed_at":"2026-08-12T14:46:55.393350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:46:55.379509Z","title":"Coded matrix chain multiplica- tion,","venue":null,"work_id":"a04938a1-6f3e-4fe0-a59f-596e0f6ac0c4","year":2021},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.213469Z"},"links":{"citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:8ac0c2e10590891bfa23dbd9d0354a6a2b6ecb9789d252ddf634e3fb4fa05d24","observation_id":"1a670609-eab4-4c25-bc22-60c01c27c31c","resolution":{"observed_at":"2026-08-12T14:46:55.383257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:46:55.368431Z","title":"Computation scheduling for distributed machine learning with straggling workers,","venue":null,"work_id":"a62e0e20-ad9b-4989-91e1-8e30e842c740","year":2019},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.217260Z"},"links":{"citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:0a850be1b749466ace755b4fbbf30a1b82f31086165172090618e458d849465a","observation_id":"9fcfd776-a6b6-4617-b9a3-846cb8598032","resolution":{"observed_at":"2026-08-12T14:46:55.371955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:46:55.358079Z","title":"An optimal coded matrix multiplication scheme for leveraging partial stragglers,","venue":null,"work_id":"883e6f25-459f-4c0b-a0c9-87fc875034e8","year":2023},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.220760Z"},"links":{"citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:a9f9b513b517ae7c2c816cb2f688bdff112e2567702f3df93573e6b6988be6e4","observation_id":"19ff863b-05fa-4954-9f8c-0fb482959987","resolution":{"observed_at":"2026-08-12T14:46:55.361802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:46:55.347604Z","title":"Exploitation of stragglers in coded computation,","venue":null,"work_id":"a57ed394-0c61-4fd2-8128-34d81f2d004f","year":2018},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.224127Z"},"links":{"citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:34c07c7fb8bffd04397376dca77a66425f68aed9e2158d917d3dbec38fd61bb4","observation_id":"e0794128-9efe-4cd3-ab14-a68577fd826c","resolution":{"observed_at":"2026-08-12T14:46:55.351198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:46:55.336904Z","title":"Straggler-aware dis- tributed learning: Communication–computation latency trade-off,","venue":null,"work_id":"e7db5569-631e-4f86-862b-7023f9fd170d","year":2020},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.227596Z"},"links":{"citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:9123532717709eb6df867d5d10d4f300b7e8c8779bfc0903f7201bd66f3dcbec","observation_id":"0cdba205-44dc-4793-b504-deb988672ca0","resolution":{"observed_at":"2026-08-12T14:46:55.340579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:46:55.326866Z","title":"Coded computation over heterogeneous clusters,","venue":null,"work_id":"9243c2cc-5a71-4c33-93bf-5c9584d66936","year":2019},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.231118Z"},"links":{"citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:69e8d633b7b2d9912823d43b45aeb5ae39e20781a27040a65b2ed6134b348402","observation_id":"bbfe0675-2395-4836-ae51-7e8b65559933","resolution":{"observed_at":"2026-08-12T14:46:55.329947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:46:55.316822Z","title":"Bivariate polyno- mial codes for secure distributed matrix multiplication,","venue":null,"work_id":"56caab00-bbfb-43a5-8162-9622f8b19a80","year":2022},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.234459Z"},"links":{"citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:8ae8483f52597b990688ce7960700e19f29687c31e8db3ef6640c99564eda35d","observation_id":"73572c07-aef1-4aa9-ae38-d82bc3cdcf00","resolution":{"observed_at":"2026-08-12T14:46:55.319778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:46:55.307055Z","title":"Bivariate polyno- mial coding for efficient distributed matrix multiplication,","venue":null,"work_id":"e0903ba6-45fd-4e73-b6fa-723b3de494c5","year":2021},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.237706Z"},"links":{"citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:2801a2a7e4a017ab22b2a65e1ad2b163c3c8332925eb3c5ebe436deadd7bcdc2","observation_id":"baf5b25b-c4bd-4921-8a5c-1b883ae9c63c","resolution":{"observed_at":"2026-08-12T14:46:55.310618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.10751","last_updated":"2018-11-27T00:06:47Z","snapshot_observed_at":"2026-08-04T05:33:21.043203Z","submitted_at":"2018-11-27T00:06:47Z","title":"A Unified Coded Deep Neural Network Training Strategy Based on Generalized PolyDot Codes for Matrix Multiplication","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.10751","snapshot_observed_at":"2026-08-12T14:46:55.241017Z","title":"A unified coded deep neural network training strategy based on generalized polydot codes for matrix multiplication,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.241017Z"},"links":{"cited_paper":"/paper/1811.10751","citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:263de3b2b0fe7d0f634ee7f2699559e8855084e24b890357c7f6a8987337f8df","observation_id":"8fd685e3-bddf-448c-b6eb-9d8e304d0886","resolution":{"observed_at":"2026-08-12T14:46:55.241017Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:46:55.296370Z","title":null,"venue":null,"work_id":"ff6f4bc0-b94c-463c-8d82-414f5bcb4851","year":2006},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.244495Z"},"links":{"citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:73ba582085098a8855776769c1657300653d4eaa446829939bbbe6ee32a8f851","observation_id":"e7fc4fcf-b9e8-4f9c-8cce-66b15eb2bde6","resolution":{"observed_at":"2026-08-12T14:46:55.300084Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:46:55.283473Z","title":"Tofec: Achieving optimal throughput-delay trade-off of cloud storage using erasure codes,","venue":null,"work_id":"06b309b7-4f76-4fb9-8bda-7c8964bfe4ed","year":2014},"citing_paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T14:46:55.247726Z"},"links":{"citing_paper":"/paper/2411.14980"},"observation_digest":"sha256:365d0d887f0d8d711f060796d6d627225bee725af2f07cc8ac528da699e39bb0","observation_id":"32d37e1c-6ed4-443e-b171-cd1bb7cc23a1","resolution":{"observed_at":"2026-08-12T14:46:55.288884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.14980","last_updated":"2024-11-22T14:39:38Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-12T14:37:04.832828Z","submitted_at":"2024-11-22T14:39:38Z","title":"Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":17},"total_outbound_references":19},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2411.14980."}