{"as_of":"2026-08-14T14:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e16c2aa0baba5d21f143985387c427d07211622155e72d21cb01ddca703c92ba","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T11:07:07.171027Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-17T05:13:37.991279Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-17T05:14:04.521074Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"cited_work":{"arxiv_id":"2502.08058","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.08058","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"General coded computing: Adversarial settings","venue":null,"work_id":"1eacbb98-0725-42dc-8c2c-d3a9712fc8a8","year":2025},"citing_paper":{"arxiv_id":"2511.20127","last_updated":"2026-04-03T19:02:26Z","snapshot_observed_at":"2026-07-06T22:36:53.831174Z","submitted_at":"2025-11-25T09:49:14Z","title":"General Multi-User Distributed Computing: A Learning-Theoretic RKHS Framework for Generic Nonlinear Target Functions with Topology-Aware Risk Analysis","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-17T05:13:37.991279Z"},"links":{"cited_paper":"/paper/2502.08058","citing_paper":"/paper/2511.20127"},"observation_digest":"sha256:308e633a2d4a1586396604652108457cfdbf4b84bba1a2e54a108a97a824538d","observation_id":"494505c2-e99d-4e2f-8fdb-5c28113b0481","resolution":{"observed_at":"2026-05-17T05:14:04.524961Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"cited_work":{"arxiv_id":"2502.08058","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.08058","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"General coded computing: Adversarial settings","venue":null,"work_id":"1eacbb98-0725-42dc-8c2c-d3a9712fc8a8","year":2025},"citing_paper":{"arxiv_id":"2605.09754","last_updated":"2026-05-10T21:04:43Z","snapshot_observed_at":"2026-07-06T23:21:49.499951Z","submitted_at":"2026-05-10T21:04:43Z","title":"Learning from Acceptance: Cumulative Regret in the Game of Coding","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-12T03:21:02.095002Z"},"links":{"cited_paper":"/paper/2502.08058","citing_paper":"/paper/2605.09754"},"observation_digest":"sha256:9816ebab8d9bdfb2fb60ab2795983002d25f673cf1d220eb5bdfdee2c597f46c","observation_id":"f062ae81-f2df-42a7-bf07-681dc0da5ee2","resolution":{"observed_at":"2026-05-12T03:21:18.564002Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.08058/citation-record","integrity":"/paper/2502.08058/integrity","json":"/paper/2502.08058/citation-record.json","paper":"/paper/2502.08058"},"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-08T11:07:07.614147Z","title":"Berrut approximated coded computing: Straggler resistance beyond polynomial computing,","venue":null,"work_id":"6a7f6e08-41b8-4a9e-9118-993904f5996a","year":2022},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.032647Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:5e6727e31d564a363f00623e102eab558c701fdc1659a6e0dc83ab9b4cb46fb0","observation_id":"cb93c085-7535-4c71-80fd-995f1b89153b","resolution":{"observed_at":"2026-08-08T11:07:07.618206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.595567Z","title":"Straggler mitigation in distributed optimization through data encoding,","venue":null,"work_id":"2ffec73f-268a-48d1-ba2c-27f11e01d8fb","year":2017},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.040956Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:659f639717f63494abf503d7c0e1c2dfde155d826e4b44483748dd7c37d91c89","observation_id":"b664052d-15a1-49b8-b85d-b96d2a455382","resolution":{"observed_at":"2026-08-08T11:07:07.599525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.584141Z","title":"ApproxIFER: A model-agnostic approach to resilient and robust prediction serving systems,","venue":null,"work_id":"1c5f5d03-e349-4a18-94ac-98bd648dc88a","year":2022},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.045305Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:105b8fce4a24813a158d7e09752c02b3447df12ccd3336130a4bbcc4d47b2a14","observation_id":"58b0bda6-d5e6-43dc-abad-4b687e66bbeb","resolution":{"observed_at":"2026-08-08T11:07:07.588206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.571908Z","title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy,","venue":null,"work_id":"9f91abea-4285-454a-bd92-29d5e441fb86","year":2019},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.049268Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:b72510fc386d57adefc6f3d79f408080b3d5427d4efefcaed7ec57cfcedec8c2","observation_id":"fe8b5fff-45a6-4251-9f49-ad5d7b636749","resolution":{"observed_at":"2026-08-08T11:07:07.576635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.561059Z","title":"Coded computing for resilient distributed computing: A learning-theoretic framework,","venue":null,"work_id":"07d1d9eb-0fec-4d46-a407-31e4446e3829","year":null},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.053038Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:975ee8f5c04c58910e8924b130ae9024ca6238ac9debed1edff83bed419d426b","observation_id":"678c9040-afb1-4324-8031-5287fcfd72e8","resolution":{"observed_at":"2026-08-08T11:07:07.564774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.08064","last_updated":"2020-06-01T18:12:02Z","snapshot_observed_at":"2026-08-14T11:04:40.864116Z","submitted_at":"2019-07-18T14:12:26Z","title":"Efficient and Robust Distributed Matrix Computations via Convolutional Coding","version":2},"cited_work":{"arxiv_id":"1907.08064","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.08064","snapshot_observed_at":"2026-08-08T11:07:07.219129Z","title":"Efficient and Robust Distributed Matrix Computations via Convolutional Coding","venue":"cs.IT","work_id":"559e5e9e-928f-4300-b4eb-a07671861c56","year":2019},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.056735Z"},"links":{"cited_paper":"/paper/1907.08064","citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:1fcaa02a949fce1e6b1d84fbe20560cae3a7359ca43d7fe78c88d0eaa14f5b9b","observation_id":"18c21f4c-3060-4a46-84b0-90b67f260e3c","resolution":{"observed_at":"2026-08-08T11:07:07.223268Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.549637Z","title":"Redundancy techniques for straggler mitigation in distributed optimization and learning,","venue":null,"work_id":"cc6d31b7-2cd1-447b-9e5f-e6a73d4fc689","year":2019},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.061609Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:5603ca0880d9797f743767a244f655780a1b28460ea6e962becea6fff84bdb46","observation_id":"334f6113-ccf2-4407-9781-323884c964fb","resolution":{"observed_at":"2026-08-08T11:07:07.554211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.065063Z","title":"Straggler mitigation in distributed matrix multiplication: Fundamental limits and optimal coding,","venue":null,"work_id":null,"year":1920},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.065063Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:ce427ff252a8cf1c297c85a27c32653df7e6209437e911960e1f6f0afb82ecfa","observation_id":"f53f8593-551a-4f53-98e9-90d89b716717","resolution":{"observed_at":"2026-08-08T11:07:07.065063Z","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-08T11:07:07.537615Z","title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication,","venue":null,"work_id":"a8822356-d935-4303-b3d3-4aeb6fb06984","year":2017},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.068420Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:7f1fee02b252943bc6f6031df83ecfa0e31cbab3e648829be986924f032f0644","observation_id":"144ade84-d232-48a8-867d-8e60f5cc4569","resolution":{"observed_at":"2026-08-08T11:07:07.541840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.526450Z","title":"Efficient and robust distributed matrix computations via convolutional coding,","venue":null,"work_id":"caf93eba-51e7-4cb3-a761-fe7162b63058","year":2021},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.071811Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:9b47093935a443aeeecd11e0ff5e75c30df42334ba6d90908daa41bfd77f83c0","observation_id":"b3ca6572-800a-4b02-acca-cb2b5edb6b91","resolution":{"observed_at":"2026-08-08T11:07:07.530319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.515726Z","title":"Oversketch: Approximate matrix multiplication for the cloud,","venue":null,"work_id":"d37cf0c5-4ba7-4137-8743-823b5232a050","year":2018},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.075426Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:370c46450eb09ab5201cb11bd01b9728f492d19613397e7bc116e757da448a43","observation_id":"d6f0fc3d-c6dd-410c-a4cc-3983f5b1c9c3","resolution":{"observed_at":"2026-08-08T11:07:07.519391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.503256Z","title":"CodedSketch: A coding scheme for distributed computation of approximated matrix multiplication,","venue":null,"work_id":"2c890773-4109-4cf4-86bc-b4c4c855b6e6","year":2021},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.079116Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:1ead365ff74048ce3c6448ecd9277bd553f52ce1ff9ca574b267405681b3c7f8","observation_id":"b85fc8a9-b0cb-4066-bc7c-49678d756219","resolution":{"observed_at":"2026-08-08T11:07:07.507969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.490811Z","title":"On the optimal recovery threshold of coded matrix multiplication,","venue":null,"work_id":"db25842a-6372-4095-95a1-ddcfc20de58b","year":2020},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.082529Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:4ac3b3655e26695b70fb4c42d530f115ddd17cdf4f0a31cdf3ad2392325a49e7","observation_id":"d7295a6d-fdc8-4fba-a715-0424e81dcc87","resolution":{"observed_at":"2026-08-08T11:07:07.495452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.479889Z","title":"Short-Dot: Computing large linear transforms distributedly using coded short dot products,","venue":null,"work_id":"d2d5fd71-6dca-42da-9242-ed64208ef793","year":2019},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.085956Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:b949e6df56e99ba76c4eadd2c486e830837b5cd0bfb1c5f1eae569f17f2d6336","observation_id":"4aa3fca0-11c6-459e-8001-3bc490543fe1","resolution":{"observed_at":"2026-08-08T11:07:07.483875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.469377Z","title":null,"venue":null,"work_id":"4a921241-9d91-44d8-8a10-fb044e0ada0c","year":2008},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.089589Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:1dc63ade4c5a12332a68f634bbe56a96f5fb9696f177078eb1b396bb8a5545fb","observation_id":"1dea82e3-039c-497a-aafe-d0e401d92e7b","resolution":{"observed_at":"2026-08-08T11:07:07.472811Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.458331Z","title":"Numerically stable polynomially coded computing,","venue":null,"work_id":"9965762b-8d04-4d61-b9b5-df36e84eee31","year":2021},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.093100Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:cb6ff3993acfe0bd5482e25de5407b51b9c4d524fe6a5e9bf85a4a732fbd2418","observation_id":"e2a19dee-d928-454d-94ed-9a12f3cba550","resolution":{"observed_at":"2026-08-08T11:07:07.462422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.445971Z","title":"Analog Lagrange coded computing,","venue":null,"work_id":"8c30c99a-38df-4f33-8e2c-0ca22f797771","year":2021},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.096349Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:c50613a1a68bbe57d13b72865acdce63a235a4e7467390bff431564ce4589865","observation_id":"952bcc0b-d9bb-4cc9-943f-07d3dccc3848","resolution":{"observed_at":"2026-08-08T11:07:07.450463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.434557Z","title":"Numerically stable coded matrix computations via circulant and rotation matrix embeddings,","venue":null,"work_id":"ffaf7d90-5ed2-4662-b697-5f8171680158","year":2021},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.099945Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:7b57639a11b89a431377115c4b88001a22ddcf44405cebc841cb9804c9615be7","observation_id":"3fe46ffd-afee-4803-8d93-3f4e3bf78701","resolution":{"observed_at":"2026-08-08T11:07:07.438406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.05965","last_updated":"2019-07-12T21:40:27Z","snapshot_observed_at":"2026-07-06T08:07:29.177402Z","submitted_at":"2019-07-12T21:40:27Z","title":"Random Khatri-Rao-Product Codes for Numerically-Stable Distributed Matrix Multiplication","version":1},"cited_work":{"arxiv_id":"1907.05965","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.05965","snapshot_observed_at":"2026-08-08T11:07:07.201004Z","title":"Random Khatri-Rao-Product Codes for Numerically-Stable Distributed Matrix Multiplication","venue":"cs.IT","work_id":"64bf6c9c-0094-40f6-ac7e-d493094c0804","year":2019},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.103262Z"},"links":{"cited_paper":"/paper/1907.05965","citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:911aa82b59aadca0d34267a98acd35e7af682e8a9aa0b222f3fe0ab9811f7b7c","observation_id":"9d9b3a1f-b7d1-48a5-a08e-4a69449d0cf0","resolution":{"observed_at":"2026-08-08T11:07:07.207408Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.422513Z","title":"OverSketch: Approximate matrix multiplication for the cloud,","venue":null,"work_id":"77982d87-eb9f-4880-8dc4-d9d92ba98283","year":2018},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.106974Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:632d38ad746a63748becc9e7741e38ba53bd24eab1ac06e6bfcdd505968534f3","observation_id":"e6c535a5-fac2-4821-b1b9-fa21efcbd8d1","resolution":{"observed_at":"2026-08-08T11:07:07.427013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.410396Z","title":"A generalized representer theorem,","venue":null,"work_id":"b5ecab0d-87d3-4135-8aa7-d136520658b1","year":2001},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.110387Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:7e546fcfeb428338913df460c6582661f548e1ccc5c09bded0b6482a93ac59a7","observation_id":"aa6ce5d7-25a8-4ba7-9301-ed44565e8b6b","resolution":{"observed_at":"2026-08-08T11:07:07.414983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.399063Z","title":"Smoothing noisy data with spline functions,","venue":null,"work_id":"f47a50a8-ead5-4e18-b031-429143d6a195","year":1975},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.113984Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:eb44ca2f7aedfa0d683df124c14e7f50c9d84d775378794cf9ab4e64e31ebc3d","observation_id":"05cf73cc-20da-4245-ac04-f47478106953","resolution":{"observed_at":"2026-08-08T11:07:07.402947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.388031Z","title":"SIAM, 1990","venue":null,"work_id":"08fdf04c-3846-4b9b-a1d4-20662b7e5775","year":1990},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.117591Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:80a107c0cce36896a13f6874336c4eec304c71ab6bb12aa2352e18e56143755e","observation_id":"0b31da35-cabb-4ff0-b20d-3bcf3ca66965","resolution":{"observed_at":"2026-08-08T11:07:07.391926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.376827Z","title":"Flexible smoothing with b-splines and penalties,","venue":null,"work_id":"3a2282d4-a527-4247-80fe-92a085b1f7c1","year":1996},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.121123Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:b16057a564c9b17a30b4f49bee2e0faa96f7fad945c59181172da621b2e9b529","observation_id":"bdc66965-995f-4390-b2e4-5654842daef7","resolution":{"observed_at":"2026-08-08T11:07:07.380562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.124543Z","title":"Gradient-based learning applied to document recognition,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.124543Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:10b33fa90cc77f7593d30b823fb9563d9ba44259dfc158b01cbc752f1e75cbaa","observation_id":"e25a4b80-7273-40ed-897a-718fd2414847","resolution":{"observed_at":"2026-08-08T11:07:07.124543Z","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-08T11:07:07.359039Z","title":"Spline smoothing: the equivalent variable kernel method,","venue":null,"work_id":"06d711d1-71e8-4c4d-ac90-bcf3a93b0bcb","year":1984},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.127818Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:d311c371cccbe5e7eeaaf31ca731da6c3b374d196a3ce01461b04b92df6934ad","observation_id":"f184b742-98cd-4ba6-9a6f-2fa63b242703","resolution":{"observed_at":"2026-08-08T11:07:07.362943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.348419Z","title":"A comparison of a spline estimate to its equivalent kernel estimate,","venue":null,"work_id":"116c56a9-a8ff-40f7-892c-3a837c462bf6","year":1991},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.131669Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:e4e66c649fcee8183cb8fe5bb154c54255a0b28899f41b9c43f33d5403967d43","observation_id":"d8acd125-f23e-4ebb-9bf5-1afe2516a229","resolution":{"observed_at":"2026-08-08T11:07:07.352206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.336369Z","title":"A new class of kernels for nonparametric curve estimation,","venue":null,"work_id":"54857e3b-44c5-4114-b658-b51f8c12c243","year":1993},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.134915Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:9e0f917063cf0d1530b8061097d086f337071f4c6c9b03d61321b37e23519add","observation_id":"2c10680d-e961-490a-8cdb-12309e0caf19","resolution":{"observed_at":"2026-08-08T11:07:07.340722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.326074Z","title":"Splines as local smoothers,","venue":null,"work_id":"9ad044d1-d0ec-429b-8094-428b73f89ab4","year":1995},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.138358Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:3ca987b9614af01725295788fb5bb9b77a2f5b2c7b795ddd634702bee8a86b61","observation_id":"ad00b9df-4139-4751-b415-e4adf631a7ce","resolution":{"observed_at":"2026-08-08T11:07:07.329715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.315226Z","title":"Leoni, A first course in Sobolev spaces","venue":null,"work_id":"d09e1dd8-e2d5-4b9d-9fb8-d7c213f84d73","year":2024},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.141889Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:6b970dd4d1ab987970e103fad956e46f25b437d1ae7f8b9450f0a57290f36551","observation_id":"1b91d998-25f7-4584-88ba-1e98bcb4998b","resolution":{"observed_at":"2026-08-08T11:07:07.319355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.145418Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.145418Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:2add51793a9fb4835b0a7420e420ed87a65ba29cbe390c1453d5e3acc204506e","observation_id":"1a8b3bba-2d4c-4a36-b240-3f479ba87851","resolution":{"observed_at":"2026-08-08T11:07:07.145418Z","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-08T11:07:07.298065Z","title":"Berlinet and C","venue":null,"work_id":"b5648511-3126-4d98-beeb-82a739fa07be","year":2011},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.148738Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:235ddce4aa0f3c29381cb32bfe20c3c001b31631d0794b18c02c9307267ec330","observation_id":"3765d493-9b2d-48c2-b0b2-7271a51ab932","resolution":{"observed_at":"2026-08-08T11:07:07.301601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.287604Z","title":"Some results on tchebycheffian spline functions,","venue":null,"work_id":"4a720439-0a2c-4dd8-832f-0a76cac69c1b","year":1971},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.152149Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:ab797df6f0801dbd05128006d2197f3585dddb8e5c0fce64c1409a4ac8905f4a","observation_id":"69aa4ab1-b140-46bd-b5b7-6475a191db83","resolution":{"observed_at":"2026-08-08T11:07:07.291627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.276236Z","title":"Splines minimizing rotation-invariant semi-norms in sobolev spaces,","venue":null,"work_id":"a05c2e5c-3149-49c5-84df-c8bb5ebfbc0a","year":1976},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.155685Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:fd10474602a97311ddd8b6c3b362db0fe729762ccdcdf5d36493bb65663878aa","observation_id":"bed746c8-817b-4d7c-b2d6-3c965ed22f54","resolution":{"observed_at":"2026-08-08T11:07:07.280366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.264959Z","title":"Error bounds for derivative estimates based on spline smoothing of exact or noisy data,","venue":null,"work_id":"5b0feaa4-45f9-4c3d-8c9e-aceeb243d118","year":1983},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.159285Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:0bc27ed7719656f5ff02e1d908a6bf949228a7b047d04dd48e2414541a37c367","observation_id":"ca89bbab-ea38-4e20-9922-126ae6210f41","resolution":{"observed_at":"2026-08-08T11:07:07.268761Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.254010Z","title":null,"venue":null,"work_id":"d033bf9a-17da-4cb1-85d4-11f405466cda","year":null},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.163022Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:ddf5df3c2fdd34a2a1609bcde60a896236201f80dc2ce8f256d45c482965df4a","observation_id":"160606bb-46ce-47d8-8f89-10e3c7048bc5","resolution":{"observed_at":"2026-08-08T11:07:07.257688Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.242251Z","title":"According to (42), as n increases, the smoothing spline behaves like a kernel smoother with a bandwidth of λ 1 4 q(t)− 1 4","venue":null,"work_id":"2c66e6e5-006c-4b24-8417-d18f6ddac7bf","year":null},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.167531Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:438af18c94542bc8adf652edc38c30dedd73a2889754552b51eb97564df5cf04","observation_id":"838c54ba-16e2-4010-839b-fbc3e5f00cac","resolution":{"observed_at":"2026-08-08T11:07:07.246133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:07:07.230268Z","title":null,"venue":null,"work_id":"9302a5c1-821d-4a7d-a75e-eedb03a9395b","year":1944},"citing_paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-08T11:07:07.171027Z"},"links":{"citing_paper":"/paper/2502.08058"},"observation_digest":"sha256:3e5edce3c0ce0240c68a98eadfb31760fac3804be7dd699f92a663c7c32192fa","observation_id":"cb1b562e-95b4-4d96-9633-0584acf6fe30","resolution":{"observed_at":"2026-08-08T11:07:07.234963Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.08058","last_updated":"2025-02-12T01:50:12Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-14T11:24:41.806705Z","submitted_at":"2025-02-12T01:50:12Z","title":"General Coded Computing: Adversarial Settings"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":2,"verified_fuzzy":29},"total_outbound_references":38},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 2 inbound Pith citation observations for arXiv:2502.08058."}