{"as_of":"2026-08-22T00:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4367565929be8e74e6a6b14354ae91cf74c72636bcae22b30165a1054bbed685","coverage":[{"denominator":63,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":63,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:24:42.530617Z","state":"measured"},{"denominator":65,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":65,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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-06-27T16:32:17.167850Z","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-07-03T01:27:31.204125Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"cited_work":{"arxiv_id":"2506.21833","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.21833","snapshot_observed_at":"2026-07-14T00:18:19.323744Z","title":"The cost of avoiding backpropagation","venue":null,"work_id":"42a4aa35-5ed6-4a55-8df4-840930f20236","year":2025},"citing_paper":{"arxiv_id":"2511.11362","last_updated":"2026-05-05T10:40:45Z","snapshot_observed_at":"2026-08-17T06:52:14.637887Z","submitted_at":"2025-11-14T14:46:29Z","title":"On-Device Fine-Tuning via Backprop-Free Zeroth-Order Optimization","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-17T22:03:53.594703Z"},"links":{"cited_paper":"/paper/2506.21833","citing_paper":"/paper/2511.11362"},"observation_digest":"sha256:53580a618a2537818ff9dff12929976b2e45e8be2ffceb20eb69460193628d95","observation_id":"66343052-d299-45cb-a710-10094bff7b71","resolution":{"observed_at":"2026-07-14T00:18:19.323744Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"cited_work":{"arxiv_id":"2506.21833","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.21833","snapshot_observed_at":"2026-07-14T00:18:19.323744Z","title":"The cost of avoiding backpropagation","venue":null,"work_id":"42a4aa35-5ed6-4a55-8df4-840930f20236","year":2025},"citing_paper":{"arxiv_id":"2606.09734","last_updated":"2026-06-08T16:59:58Z","snapshot_observed_at":"2026-08-15T04:58:56.829898Z","submitted_at":"2026-06-08T16:59:58Z","title":"Adaptive directional gradients for parameterised quantum circuits","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-27T16:32:17.167850Z"},"links":{"cited_paper":"/paper/2506.21833","citing_paper":"/paper/2606.09734"},"observation_digest":"sha256:b6e75f945e60d3d58c4e7fefec916a2cfe8d95db9163c2ba8dd35677779b2f46","observation_id":"758608db-3ffd-41e6-abf5-ded96924dcae","resolution":{"observed_at":"2026-07-14T00:18:19.323744Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.21833/citation-record","integrity":"/paper/2506.21833/integrity","json":"/paper/2506.21833/citation-record.json","paper":"/paper/2506.21833"},"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-06T22:24:51.614556Z","title":"Learning representations by back- propagating errors","venue":null,"work_id":"0ec33bbb-dd3d-4b7d-9da7-35f98791a6aa","year":1986},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:36.365056Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:641c2f2e1bf3109cbb34b7066f79d7e49926b8fb8fdfad74b0faa2ed2db9b4e4","observation_id":"223ace94-af0d-4976-8e12-0af6cdde2976","resolution":{"observed_at":"2026-08-06T22:24:51.691572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:51.514838Z","title":"Pytorch: An imperative style, high-performance deep learning library","venue":null,"work_id":"f32a7342-75e7-4bc0-b8d4-1ef28daef0cf","year":2019},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:36.436501Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:5141d8b9ee2488cd8a78836739e61d70a1e7c58c87220f634bd683b2928fc233","observation_id":"85cb3c12-c42b-4f89-a4ec-113495d72e19","resolution":{"observed_at":"2026-08-06T22:24:51.557436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:51.366983Z","title":"JAX: compos- able transformations of Python+NumPy programs, 2018","venue":null,"work_id":"68a712b4-8238-4417-a296-fbd258fb7c1b","year":2018},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:36.496068Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:be8ae6a8bead1726ca79c46b15036b77b6b66618317cdd4aecc89516fd4b893a","observation_id":"96f3fe66-92da-4a7b-a450-ef9ca3c3a1fe","resolution":{"observed_at":"2026-08-06T22:24:51.427079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:51.281122Z","title":"Pearlmutter, Alexey Andreyevich Radul, and Jeffrey Mark Siskind","venue":null,"work_id":"ffefd81a-67da-4ea0-aacf-b0c793b9a65e","year":2017},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:36.599684Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:ea890b270938627c20e090750b516057465d659a01b7f43a231ff3d11fba4f74","observation_id":"0c08dc12-b0ab-47c9-828d-95d2bbb0459a","resolution":{"observed_at":"2026-08-06T22:24:51.321760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.08587","last_updated":"2022-02-17T11:07:55Z","snapshot_observed_at":"2026-08-19T00:45:13.062786Z","submitted_at":"2022-02-17T11:07:55Z","title":"Gradients without Backpropagation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.08587","snapshot_observed_at":"2026-08-06T22:24:36.653035Z","title":"Pearlmutter, Don Syme, Frank Wood, and Philip Torr","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:36.653035Z"},"links":{"cited_paper":"/paper/2202.08587","citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:854d09d68c85671c7b3917be2b441c3b6b2bfb4ce788b6d8ec0e368c1c2a6d3b","observation_id":"9ba97522-e0d2-4c4c-8e9e-2ed397839ccc","resolution":{"observed_at":"2026-08-06T22:24:36.653035Z","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-06T22:24:51.169149Z","title":"Thinking for- ward: Memory-efficient federated finetuning of language models","venue":null,"work_id":"ca9812bc-c72d-4502-8905-fb053f35624b","year":2024},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:36.659392Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:683cd1dd653ec182cd943899d38297a8965cfacb2f267ef7e99fd0de65908ef3","observation_id":"1efb16a1-fbc5-405a-bdc5-6b9e2d9db14e","resolution":{"observed_at":"2026-08-06T22:24:51.222196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:51.070395Z","title":null,"venue":null,"work_id":"499a510f-1f6a-4628-9bf4-94fe1a0e5533","year":1955},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:36.746281Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:a97d019f7aa2030fede07bf3a126162f1020fa7bf00d9250c8035e761f088f45","observation_id":"117ae598-d3a1-4bce-8792-37abd6814b11","resolution":{"observed_at":"2026-08-06T22:24:51.113655Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:50.962534Z","title":"Lee, Danqi Chen, and Sanjeev Arora","venue":null,"work_id":"87030978-c07e-43d0-99cd-d67b8e4fbda6","year":2023},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:36.884141Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:0f67969834a734687dfc20768f368b30151d523e07699ca3f490e5818cf6bef1","observation_id":"84642e57-df2b-4162-b808-24d1a23851e8","resolution":{"observed_at":"2026-08-06T22:24:51.010595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1604.06174","last_updated":"2016-04-22T19:21:36Z","snapshot_observed_at":"2026-08-14T14:33:36.303679Z","submitted_at":"2016-04-21T04:15:27Z","title":"Training Deep Nets with Sublinear Memory Cost","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.06174","snapshot_observed_at":"2026-08-06T22:24:36.976085Z","title":"Training deep nets with sublinear memory cost","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:36.976085Z"},"links":{"cited_paper":"/paper/1604.06174","citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:3342aec2ee0cb0ea3819daadb13b5537f826fa11556013968c820149769058a2","observation_id":"719000f9-0e88-4ef1-aa81-32babd5cc012","resolution":{"observed_at":"2026-08-06T22:24:36.976085Z","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-06T22:24:50.835909Z","title":"Zeroth-order stochastic variance reduction for nonconvex optimization","venue":null,"work_id":"085ed69c-b6c0-4a64-8f91-41c0d12e6cb2","year":2018},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:37.096603Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:529c50e418472f8c826a43011af52e6606f1190d9b974bf5f02dc575c22ee4b5","observation_id":"36598834-bb78-4d2f-9f0e-3a6d01eb9aa0","resolution":{"observed_at":"2026-08-06T22:24:50.895455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:50.733446Z","title":"Baffle: A baseline of backpropagation-free federated learning","venue":null,"work_id":"e0f9d6de-9154-4423-b9e2-10c9caf9c03e","year":2024},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:37.196264Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:86af1b05ffc1832677b497637240d25d1dbc2da2d2e57b7ee950ee2168f6b19c","observation_id":"9a66c90e-ded8-488d-baea-94751f9bb221","resolution":{"observed_at":"2026-08-06T22:24:50.771453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:50.607520Z","title":"Variance-reduced zeroth-order methods for fine-tuning language models","venue":null,"work_id":"db84deea-948d-4d73-8869-5aa92d3056f7","year":2024},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:37.291598Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:01a4055f09d15d1bc5b09e0201cc135d5d28306ac144f14ff622c8c282765d87","observation_id":"490361eb-fbef-4eaf-a0e6-d12c1c574525","resolution":{"observed_at":"2026-08-06T22:24:50.651807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:50.447528Z","title":"Zo-adamm: Zeroth-order adaptive momentum method for black-box optimization","venue":null,"work_id":"4563e0b2-2e59-41cc-abb4-99c63e2b6956","year":2019},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:37.389615Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:ead84f3f1afaf9b6edc4b365311aaf9c36bd3d804b17f3b78950ce2d29529423","observation_id":"e6d5134b-af78-42ef-9e44-a0c8d04aaf50","resolution":{"observed_at":"2026-08-06T22:24:50.509088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:50.330148Z","title":"Gardner, Osbert Bastani, Christopher De Sa, Xiaodong Yu, Beidi Chen, and Zhaozhuo Xu","venue":null,"work_id":"a87df491-6ab6-473b-a607-b8230f5e80fd","year":2025},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:37.488399Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:0b7647a9798956100ecefb48dc09f4200ef0f518759b13fed0c7eaefb0bda1b2","observation_id":"e316ca5e-607c-4fd4-bdfa-43c1ee91a74d","resolution":{"observed_at":"2026-08-06T22:24:50.374257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:50.066872Z","title":"Optimization methods for large-scale machine learning","venue":null,"work_id":"e03102db-93fb-4c02-ada6-84fa1daee806","year":2018},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:37.583987Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:ef7d12509b333b7fe43983f1d7c7f61a24c6c356e2df9c68abbdd76f86268c1e","observation_id":"223d7d5f-61bc-4b1f-ac63-a315ae79c158","resolution":{"observed_at":"2026-08-06T22:24:50.151952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.11235","last_updated":"2024-03-09T13:28:29Z","snapshot_observed_at":"2026-08-19T11:16:43.629164Z","submitted_at":"2023-01-26T17:18:36Z","title":"Handbook of Convergence Theorems for (Stochastic) Gradient Methods","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.11235","snapshot_observed_at":"2026-08-06T22:24:37.682404Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:37.682404Z"},"links":{"cited_paper":"/paper/2301.11235","citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:a58f9332c68c1d1f9bb76bf0a9bae28a78ce8057e1ab41e3563cddd0f5cc22ef","observation_id":"c7ab788e-7c16-4494-83ce-888e2d083663","resolution":{"observed_at":"2026-08-06T22:24:37.682404Z","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-06T22:24:49.802280Z","title":"Zeroth-order methods for nondifferentiable, noncon- vex, and hierarchical federated optimization","venue":null,"work_id":"b19b15ee-49d9-4362-a4fe-d076b2b5bd3e","year":2023},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:37.762297Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:943724e70a84bd244936265bb7ae5443b5988b78d86a544a04322a68680b3c9e","observation_id":"a5b17a37-c4bb-4e1e-bb6c-2d129298b1e8","resolution":{"observed_at":"2026-08-06T22:24:49.938485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:49.580837Z","title":"An optimal structured zeroth-order algorithm for non-smooth optimization","venue":null,"work_id":"fe6e4027-491d-47d9-a1d3-d5f84409f228","year":2023},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:37.825143Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:8f80d90502dfe1e3d145ab6ab52c098f1c035092fccfe855e8201ee2feca1019","observation_id":"0c1e1677-9184-46d2-b2db-e55b4169e216","resolution":{"observed_at":"2026-08-06T22:24:49.673653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:49.411567Z","title":"Black-box generalization: Stability of zeroth-order learning","venue":null,"work_id":"394bdd3e-2a30-478e-ad4b-15ef36854ab7","year":2022},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:37.899009Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:ed98e5943f72b6d346f16e84dd2a49571f81828d32762704fda6333a566515ff","observation_id":"6e60a698-7e2e-4fe5-a353-680cef283c73","resolution":{"observed_at":"2026-08-06T22:24:49.465689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:49.253611Z","title":"black-box","venue":null,"work_id":"e3545bee-ed27-48dc-badc-cdb830306f0f","year":2024},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:37.958089Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:2433dceecaca4d39829a58cba52c891b76580ad9b4b6d06381a50e94faee12a2","observation_id":"4641a2b0-ced9-4549-a44f-e9e81c7ca9a3","resolution":{"observed_at":"2026-08-06T22:24:49.312565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-14T02:43:01.480086Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-06T22:24:38.029009Z","title":"Training verifiers to solve math word problems","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:38.029009Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:95d9ecb8a1c3c8136c7239c77dc8b8504d73d74e7b0c87794c194c4f8b6af3b1","observation_id":"e42e3454-df76-43c5-8623-4ce76cf1508e","resolution":{"observed_at":"2026-08-06T22:24:38.029009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:24:38.096664Z","title":"Measuring massive multitask language understanding","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:38.096664Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:a3c088289572ff25e44c4cba173b1aeb54722030dcdf1c0e87cc2ce80ec27d92","observation_id":"7e2ad63c-f902-4667-bb32-76d5ffcbfc3c","resolution":{"observed_at":"2026-08-06T22:24:38.096664Z","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-06T22:24:49.051411Z","title":"Character-level convolutional networks for text classification","venue":null,"work_id":"2a2c63c4-db5f-4583-bdbc-e4da76c91556","year":2015},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:38.168782Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:297af05c3e1cb974da723dcc27f72c7d635b406590d16358b614fdf3a9e8c865","observation_id":"b1544271-e0a2-4aaf-8086-2bc933a19645","resolution":{"observed_at":"2026-08-06T22:24:49.107273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:38.234126Z","title":"Boolq: Exploring the surprising difficulty of natural yes/no questions","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:38.234126Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:db9998ced2b813756482bbf85d165ca31775d77e49e5ef55ec0c930f28454db9","observation_id":"c2cc2352-fae5-46b3-b12d-18bb15f9ea36","resolution":{"observed_at":"2026-08-06T22:24:38.234126Z","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-06T22:24:48.865345Z","title":"Looking beyond the surface: A challenge set for reading comprehension over multiple sentences","venue":null,"work_id":"d6d3921b-4869-468e-b24c-64cd582a7c85","year":2018},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:38.317772Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:c166ce3ede40812b02b9e58afe23e5d35a5755ba04caf04d38dc616e0e75eb79","observation_id":"dddf8d7b-fdef-4493-b901-2cd3daa624fe","resolution":{"observed_at":"2026-08-06T22:24:48.941177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:48.725122Z","title":"Making the v in vqa matter: Elevating the role of image understanding in visual question answering","venue":null,"work_id":"11693d7f-3861-415a-8d9d-9899e9221deb","year":2019},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:38.390082Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:2ca6cf11c32702bd23d192881dbf926a11e7897a89d51fdf04b33feebf68123d","observation_id":"c31f271b-6912-4074-873d-b7495a190527","resolution":{"observed_at":"2026-08-06T22:24:48.781349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:48.550465Z","title":"Towards vqa models that can read","venue":null,"work_id":"7dd84c12-1723-48fa-b3c6-f3078b8db461","year":2019},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:38.485544Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:fc430fe2a2fb81a16fd6c068cacbb99083c51728e95d5b5a37422b16f25dcfa7","observation_id":"e863c261-5c2f-42f1-9ef6-4ea3890232f8","resolution":{"observed_at":"2026-08-06T22:24:48.623118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-06T22:24:38.559884Z","title":"The llama 3 herd of models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:38.559884Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:a91325cf3ca36742df560865688ba61325486a5456e2e9096fcc7a1a1352b6a1","observation_id":"5d0be743-32b3-4ad6-8a0c-75188b4f8226","resolution":{"observed_at":"2026-08-06T22:24:38.559884Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.01068","last_updated":"2022-06-21T17:04:40Z","snapshot_observed_at":"2026-08-06T03:13:37.403059Z","submitted_at":"2022-05-02T17:49:50Z","title":"OPT: Open Pre-trained Transformer Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.01068","snapshot_observed_at":"2026-08-06T22:24:38.635377Z","title":"Opt: Open pre-trained transformer language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:38.635377Z"},"links":{"cited_paper":"/paper/2205.01068","citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:6d229f0bdb97f56c288c12f41e230c2015adde1db927ebbacec17f53af35106b","observation_id":"8c421d80-3a3d-4a98-8f34-8eb793cd6091","resolution":{"observed_at":"2026-08-06T22:24:38.635377Z","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-06T22:24:48.321284Z","title":"BERT: Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":"facd2e60-54cb-4045-bfcb-7f3fbacbe4bc","year":2019},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:38.705786Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:235fb40b877bc24be2bc6dff4a403a0da5745d7231f7f4b828b19aecc09f2bd7","observation_id":"b7f08390-a52c-4d4c-a877-90c8ed239e07","resolution":{"observed_at":"2026-08-06T22:24:48.399794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:48.135391Z","title":"Ro{bert}a: A robustly optimized {bert} pretraining approach, 2020","venue":null,"work_id":"414a3ef9-42d0-4d64-9b58-21c5d55b80f5","year":2020},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:38.811719Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:266e31c40b21f8885c1f2691f65b526794e8220724c60c2928b33238691f673c","observation_id":"af2d61bd-fd42-46d8-8f25-c419ddb44add","resolution":{"observed_at":"2026-08-06T22:24:48.221060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:38.919405Z","title":"Qwen2.5 technical report, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:38.919405Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:18de46b19b59bab90e3272de1fc59eea2f5d4af637f58addb2a990ea77f25390","observation_id":"4afdf240-28e4-45c9-a36b-c1dbb9831c78","resolution":{"observed_at":"2026-08-06T22:24:38.919405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14314","last_updated":"2023-05-23T17:50:33Z","snapshot_observed_at":"2026-08-20T16:10:20.713555Z","submitted_at":"2023-05-23T17:50:33Z","title":"QLoRA: Efficient Finetuning of Quantized LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14314","snapshot_observed_at":"2026-08-06T22:24:38.977283Z","title":"Qlora: Efficient finetuning of quantized llms","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:38.977283Z"},"links":{"cited_paper":"/paper/2305.14314","citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:95ee671aa237dbd05f7dc4c9c579212f916e3a3918f9e5ee20123f0722d2f5ca","observation_id":"9dd08c2f-7964-4e31-996e-2fc5a6d6e889","resolution":{"observed_at":"2026-08-06T22:24:38.977283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.17323","last_updated":"2023-03-22T13:10:47Z","snapshot_observed_at":"2026-08-16T07:57:19.216626Z","submitted_at":"2022-10-31T13:42:40Z","title":"GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.17323","snapshot_observed_at":"2026-08-06T22:24:39.102792Z","title":"Gptq: Accurate post-training quantization for generative pre-trained transformers","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:39.102792Z"},"links":{"cited_paper":"/paper/2210.17323","citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:4a60c797015f767eac78061feae73b794ae848508ff6d759b7738f5d1571e046","observation_id":"daa6a007-f163-48ab-a4d1-4d5109e20e69","resolution":{"observed_at":"2026-08-06T22:24:39.102792Z","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-06T22:24:47.978190Z","title":"Implementation of FGD, 2023","venue":null,"work_id":"8521a24f-1685-419d-a9d4-7fe896682a89","year":2023},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:39.275946Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:82ae3ba79d1d6069aecdd687e8b16708e7e4ae427edc51fe6d7fe9d339f5bbf5","observation_id":"6477383c-cd83-4dda-b65a-e36a2e4fe41b","resolution":{"observed_at":"2026-08-06T22:24:48.043166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:47.675741Z","title":"Can forward gradient match backpropagation? In Proceedings of the 40th International Conference on Machine Learning, 2023","venue":null,"work_id":"a5c02e13-4a03-4a66-b276-ca600a695f9d","year":2023},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:39.413468Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:25baf7cf15000a9bfad8a35bc1d0fda4f06bea89bff0045850bc51f71b79c3ff","observation_id":"f5c3df7c-48f1-470f-9437-c34e6247d8a0","resolution":{"observed_at":"2026-08-06T22:24:47.777400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.10419","last_updated":"2024-08-19T21:12:41Z","snapshot_observed_at":"2026-08-16T13:25:23.422998Z","submitted_at":"2024-08-19T21:12:41Z","title":"Second-Order Forward-Mode Automatic Differentiation for Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.10419","snapshot_observed_at":"2026-08-06T22:24:39.542509Z","title":"Cobb, Atılım Güne¸ s Baydin, Barak A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:39.542509Z"},"links":{"cited_paper":"/paper/2408.10419","citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:8ddfbaf9f9462c644122df269d50a82e1bf496077c529b4f4a6abb37177f7a3b","observation_id":"a1ec6221-d437-409d-8106-54c79bbd8f7d","resolution":{"observed_at":"2026-08-06T22:24:39.542509Z","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-06T22:24:47.524783Z","title":"Johnson, and David Duvenaud","venue":null,"work_id":"0ccfd9de-2a62-47f1-98be-55ed2de97089","year":2019},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:39.658509Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:fa59fdc9e6671b938b2f1fc60903bbecd044e9c3cb443724812e8c349c4faa2e","observation_id":"ca20739e-a7ce-4609-a1ea-897c2873b19c","resolution":{"observed_at":"2026-08-06T22:24:47.598244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.14168","last_updated":"2024-02-01T20:33:02Z","snapshot_observed_at":"2026-08-18T21:39:17.893772Z","submitted_at":"2023-10-22T04:02:39Z","title":"Randomized Forward Mode of Automatic Differentiation For Optimization Algorithms","version":3},"cited_work":{"arxiv_id":"2310.14168","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.14168","snapshot_observed_at":"2026-08-06T22:24:43.180810Z","title":"Randomized Forward Mode of Automatic Differentiation For Optimization Algorithms","venue":"math.OC","work_id":"21897c14-fca9-473f-9817-a7e581d6dc52","year":2023},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:39.799280Z"},"links":{"cited_paper":"/paper/2310.14168","citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:7298c40dd9bc8e875057a798b8dc57c3e881a8538bdff504d916ecbbcf579ad9","observation_id":"580b9cb6-3403-4614-bf59-a10c59fc17db","resolution":{"observed_at":"2026-08-06T22:24:43.264224Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12511","last_updated":"2024-12-25T07:29:42Z","snapshot_observed_at":"2026-08-21T12:59:39.844000Z","submitted_at":"2024-03-19T07:25:36Z","title":"Projected Forward Gradient-Guided Frank-Wolfe Algorithm via Variance Reduction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12511","snapshot_observed_at":"2026-08-06T22:24:39.946793Z","title":"Forward gradient-based frank-wolfe optimization for memory efficient deep neural network training","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:39.946793Z"},"links":{"cited_paper":"/paper/2403.12511","citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:89c551a0142494c5325a707ce9e5beaf2c9d4146fcff48645f828583d3a445af","observation_id":"365fbf64-2690-4d6e-8c6b-c4da7a6a31ae","resolution":{"observed_at":"2026-08-06T22:24:39.946793Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:24:40.075268Z","title":"Beyond backpropagation: Optimization with multi-tangent forward gradients","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:40.075268Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:6643c4ff2b17f99b9b78e3a5e76536ddb7a106435f40c56d3fd151b4b0200e4f","observation_id":"4120410e-520f-4fb7-98f7-1b51f368dc03","resolution":{"observed_at":"2026-08-06T22:24:40.075268Z","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-06T22:24:47.362627Z","title":"Deepzero: Scaling up zeroth-order optimization for deep model training","venue":null,"work_id":"e57033eb-1369-4639-896f-04537e655d01","year":2024},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:40.197858Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:c7e8e19bed033e915d9ad2ed5a28fab8cca7768cb6c4f8626a801a245da3812b","observation_id":"3f39ed2d-bfb5-41cf-82ce-00fce627adf8","resolution":{"observed_at":"2026-08-06T22:24:47.450362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.18883","last_updated":"2023-10-29T03:13:45Z","snapshot_observed_at":"2026-08-16T14:47:57.246970Z","submitted_at":"2023-10-29T03:13:45Z","title":"A Zeroth-Order Variance-Reduced Method for Decentralized Stochastic Non-convex Optimization","version":1},"cited_work":{"arxiv_id":"2310.18883","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.18883","snapshot_observed_at":"2026-08-06T22:24:42.744392Z","title":"A Zeroth-Order Variance-Reduced Method for Decentralized Stochastic Non-convex Optimization","venue":"math.OC","work_id":"66d360e8-f57a-4bba-af15-406a28acda16","year":2023},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:40.352002Z"},"links":{"cited_paper":"/paper/2310.18883","citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:3a132be996adcf2be2f188c51dc1033903fa0a93bb04e296448b17fd8338ee4f","observation_id":"0bb6fcac-00fa-41f2-a633-e902afc47035","resolution":{"observed_at":"2026-08-06T22:24:42.826240Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:47.222507Z","title":"Accelerating stochastic gradient descent using predictive variance reduction","venue":null,"work_id":"12b83004-bd17-4ee9-8e68-84b7e6f9e1a4","year":2013},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:40.495917Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:c1319029a5957135ab731ed2e673df2e39b851c5f04678d7a7d1951d6399062d","observation_id":"64de91bb-c77f-47b0-98d6-93fca0c3b678","resolution":{"observed_at":"2026-08-06T22:24:47.283902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:47.070787Z","title":"Zeroth-order methods for constrained nonconvex nonsmooth stochastic optimization","venue":null,"work_id":"4bb99995-f50e-4fba-9911-27d4ea3b63c6","year":2024},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:40.633148Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:ccd6c8d9997ddc8e7e70c4e23e7c485a43b4adddade28db6a89f3e04a2f3439f","observation_id":"d0e25900-4d5c-4791-9f83-94afaf032c2a","resolution":{"observed_at":"2026-08-06T22:24:47.127599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:46.887368Z","title":"An algorithm with optimal dimension-dependence for zero-order nonsmooth nonconvex stochastic optimization","venue":null,"work_id":"2e6941ec-ee39-4436-9c81-8eccc57b6d99","year":2024},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:40.725132Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:054c088fdaa98a4baf6006346bb275c207de1b1676bea16adc4654426fd3262c","observation_id":"2b60c469-19cb-4929-914b-6840db2401a5","resolution":{"observed_at":"2026-08-06T22:24:46.972260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:46.740610Z","title":"Zeroth-order (non)-convex stochastic optimization via conditional gradient and gradient updates","venue":null,"work_id":"c0031175-1814-43b6-bbfa-a9a2b1ccd386","year":2018},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:40.816509Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:5d5a3cdd9002dda7a0fabcf5f6d130ab097bc36409a8c34b57275f3473a1c542","observation_id":"a22605cf-aeb4-4068-95d0-6c15ca6eae9d","resolution":{"observed_at":"2026-08-06T22:24:46.806347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:46.603570Z","title":"Stochastic zeroth-order optimization in high dimensions","venue":null,"work_id":"b140888b-502b-432b-a76d-bbeefdc2da34","year":2018},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:40.938589Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:1ba5c3e0042be5a94218f4ca8e420e0b6d169140e64f1ddae4e12188e0cefd2c","observation_id":"e4bd5b45-8598-49dd-88f9-ebdc86370fd6","resolution":{"observed_at":"2026-08-06T22:24:46.672946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:46.425365Z","title":"Lee, Wotao Yin, Mingyi Hong, Zhangyang Wang, Sijia Liu, and Tianlong Chen","venue":null,"work_id":"01ccece0-7ee3-41c0-93b4-2aed367a0c55","year":2024},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:41.025267Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:62670acf113443f97347423e48339079c31a8675a499781f001716e29a3a246f","observation_id":"0c7a9c68-eb54-4860-b526-1d0ecf9e3d48","resolution":{"observed_at":"2026-08-06T22:24:46.520999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:46.165371Z","title":"The reversible residual network: Backpropagation without storing activations","venue":null,"work_id":"9fc4458a-e265-442f-8fb6-5088297f8afe","year":2017},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:41.091391Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:491c899f7048525ae0ff341fe410b122f0a11ff16286632bbfe254c9555990b4","observation_id":"d3c78ce2-1bc2-453f-9f1b-6033ff4a8bf3","resolution":{"observed_at":"2026-08-06T22:24:46.282273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:45.953296Z","title":"Memory-efficient backpropagation through time","venue":null,"work_id":"569178b5-0df2-4dd1-a30a-adc97ef02ae2","year":2016},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:41.173307Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:5af374981a2092b18c1fa1f8bc2b3f74cc971ded6073e0d845677c687d14a01b","observation_id":"9fb01c0c-cbac-483e-8867-50f53d47dc97","resolution":{"observed_at":"2026-08-06T22:24:46.069832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:45.786931Z","title":"Efficient combination of rematerialization and offloading for training dnns","venue":null,"work_id":"5ace994e-6690-4eac-a33f-339a2dc3f283","year":2021},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:41.294640Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:5e0f9f93b4aa1c4510a3b6cddf6c52d665a38c217efe365553fe2f6195f4d8cf","observation_id":"00090d90-5224-4346-a232-c4f6aa8f1ae7","resolution":{"observed_at":"2026-08-06T22:24:45.886113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:45.605520Z","title":"Agnews on huggingface","venue":null,"work_id":"a1c8f16a-14ae-4a0e-8909-19d1b0a225a4","year":2022},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:41.364528Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:0442d52118cfcd0045a5712ec855fa23c8f7e24333346d5a955a7ee3b1badc30","observation_id":"c5f30b41-92e4-4c83-b6c1-6776b0eefdfb","resolution":{"observed_at":"2026-08-06T22:24:45.677207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:45.421824Z","title":"Boolq on huggingface","venue":null,"work_id":"c376818a-bb6f-4f02-808e-c010e5ceb499","year":2022},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:41.501695Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:47a4df498826c86bbafbe030add14fa65efea345d8e6dda1ca2a314d673408a3","observation_id":"76e490e4-8299-4b99-9ed2-9f5a9e1ceb46","resolution":{"observed_at":"2026-08-06T22:24:45.470768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:45.233560Z","title":"Multirc on huggingface","venue":null,"work_id":"04d5cd4f-d2f7-47da-9d7d-ce6aad5cebb7","year":2022},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:41.583997Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:e2c8ec3570be2228ea1505381cedd1e9eef648238325c2733340a9d3d89d2308","observation_id":"2ada20fe-48a0-4a2c-9f00-3117fdd3a7fc","resolution":{"observed_at":"2026-08-06T22:24:45.314525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:45.030534Z","title":"Gsm8k on huggingface","venue":null,"work_id":"0090359f-c153-4950-8ff8-6dd48fa00236","year":2022},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:41.658327Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:6120c65229f227862d29afdc546188e74bd18774f86f05a7c4a1cbada12560b2","observation_id":"087ab0c6-df39-421f-a6b3-ff5b17857999","resolution":{"observed_at":"2026-08-06T22:24:45.126723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:44.847631Z","title":"Mmlu on huggingface","venue":null,"work_id":"5dac12f3-5b0f-4d9b-992e-b68ff87b8d1c","year":2024},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:41.750951Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:e96a19583abc902efbe7f6af6fff578a0894d558dc124abc53bd80bfc93b14b8","observation_id":"b2405e4e-5f48-4c78-8bdb-0dc340d387b9","resolution":{"observed_at":"2026-08-06T22:24:44.912389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:44.677018Z","title":"Lawrence Zitnick","venue":null,"work_id":"a7d91c9f-335e-4b1a-9de1-fb32376da1b4","year":2014},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:41.886238Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:c7e022ca158075e327adac6882b7688db10a78353def6fc535a0e6d6214f581b","observation_id":"3d33ad39-a8e9-4d16-aeb6-8006813ed90e","resolution":{"observed_at":"2026-08-06T22:24:44.749607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:44.431618Z","title":null,"venue":null,"work_id":"5308d562-3429-49df-857b-0685da3973e7","year":2017},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:42.011943Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:c17f12a4dc51a05ec6bc3cbc7e38750377962dfe85f1d36ced5f4c4c3e600e34","observation_id":"b8072450-0053-41b9-a721-2c1d3d831928","resolution":{"observed_at":"2026-08-06T22:24:44.536787Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:44.180444Z","title":"Textvqa on huggingface","venue":null,"work_id":"dfc84fde-fc2a-4832-902d-983861e518be","year":null},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:42.093851Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:e93fc23738721a815877b20a71b993601b8e8665fa276f4abc580daad1034840","observation_id":"739ac406-c315-4872-ab6f-ef0bc0e661b5","resolution":{"observed_at":"2026-08-06T22:24:44.312544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:43.755200Z","title":"Fwdllm: Efficient federated finetuning of large language models with perturbed inferences","venue":null,"work_id":"03afd23e-7ee9-4a21-b4d4-e762750ce9a5","year":2024},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:42.400326Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:e6e1023031f76da8d2c5b1f2e121881f0a61ec181aa88f412b0e3ca220f1fa37","observation_id":"8d8254eb-762c-4785-9f69-44b92f11303d","resolution":{"observed_at":"2026-08-06T22:24:43.848293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:43.580289Z","title":"yes” or “no","venue":null,"work_id":"89e71115-5518-4241-b5ad-95bc67a1489a","year":2021},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:42.530617Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:f3df7d9928d237a9021ad1f2a0a4d3d92da7ac52c5e00da88b92cb6108d05635","observation_id":"7ddddc25-3ccf-4be4-b96e-6c7f02b32a1c","resolution":{"observed_at":"2026-08-06T22:24:43.679174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T22:24:43.986278Z","title":null,"venue":null,"work_id":"f0ed4c4f-0d41-479a-b0f0-151593e75e6b","year":2025},"citing_paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-06T22:24:42.208410Z"},"links":{"citing_paper":"/paper/2506.21833"},"observation_digest":"sha256:65d073f01989126038f3e48526d8e6b94bc842269e967a24cb59a595264d5651","observation_id":"2ec87f22-d107-4bd6-befc-af0f5c4f6ad3","resolution":{"observed_at":"2026-08-06T22:24:44.077486Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.21833","last_updated":"2026-07-10T19:11:43Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T01:25:49.190171Z","submitted_at":"2025-06-27T00:47:03Z","title":"Memory Savings at What Cost? A Study of Alternatives to Backpropagation"},"reference_resolution":{"displayed":63,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":2,"verified_fuzzy":44},"total_outbound_references":63},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 63 of 63 outbound references and 2 inbound Pith citation observations for arXiv:2506.21833."}