{"as_of":"2026-08-17T01:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b1b4e78b745b41d652ddb0c8d88421b5d00d62ce034bbd366fdc9c1c9830264d","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:53:08.187486Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.08394/citation-record","integrity":"/paper/1908.08394/integrity","json":"/paper/1908.08394/citation-record.json","paper":"/paper/1908.08394"},"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-14T11:53:08.565695Z","title":"Let ∇FSC(x) = 0, that is ( L − µ 2n A (√ 2 α + 1 ) + µ I ) x = L − µ n(α + 1) ξem, or         ω 2 + 1 + 2nµ L−µ −1 −1 2 + 2nµ L−µ −1","venue":null,"work_id":"910bea97-3943-492f-be56-f872d721bf4d","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.069385Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:0ebda6c6de1bcd8d0d06e9fc2ab7c8b81cb7bc41e82ed932ae5346cf228294eb","observation_id":"6fe1ccc5-0a46-4e25-abf2-ced9f523959e","resolution":{"observed_at":"2026-08-14T11:53:08.571283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.549920Z","title":"Let y = xm−k+1:m ∈ Rk and Ak be last k rows and columns of the matrix in Equation (22)","venue":null,"work_id":"1379fbd0-4c24-4200-8b11-5c95afc89fbd","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.074976Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:94092df5f02d37ed3551953ebda00e8d9e38c9be97575120ab525395aeabdabc","observation_id":"bbfbf7b7-b404-4e83-9a72-ec0f7ee56acb","resolution":{"observed_at":"2026-08-14T11:53:08.555397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.582445Z","title":null,"venue":null,"work_id":"c3f2b093-c59b-453f-ae35-1e629a472923","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.081046Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:10761824c59e21a7f045b97152f1bc6747813834192a621b68013bbbe4d62212","observation_id":"4cecb75d-21d6-4a83-a02b-f2ad16704389","resolution":{"observed_at":"2026-08-14T11:53:08.587315Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.533738Z","title":"Let ∇FC(x) = 0, that is L 2n A(1)x = ξ n em, or        2 −1 −1 2 −1","venue":null,"work_id":"9d69bdf4-c87b-4de3-99ac-9a2e15664dbf","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.086118Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:92805b428b2e2e1a479460fcac7da4f96779e36a5eb6267c2fa2e60d36c5ce86","observation_id":"ee18b3ba-2f76-412f-869d-df574513ec9d","resolution":{"observed_at":"2026-08-14T11:53:08.539423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.518532Z","title":"Thus min x∈Fk FC(x) − FC(x∗) = ξ2 nL (m − k)","venue":null,"work_id":"5f80cd10-5e02-4eb0-9477-2b1e7656e592","year":2017},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.091714Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:c93830a33249ce1805bdceca8e00df6097e038c593761c53cffe53bc95da8094","observation_id":"f13ed542-7ca9-4dc1-8a75-bf551411d25d","resolution":{"observed_at":"2026-08-14T11:53:08.523560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.503323Z","title":null,"venue":null,"work_id":"f7bad80a-bf46-4669-bafd-7074524171ba","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.098320Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:e0ce72875e127a03ada14915c0dace2a3f0c9bc4fed622f1f8255e7fc94701b3","observation_id":"8c6c009f-dc48-4c06-b072-986cd2bd315c","resolution":{"observed_at":"2026-08-14T11:53:08.508013Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.487930Z","title":null,"venue":null,"work_id":"d496fa09-504f-40b2-a639-58688cffcde8","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.104424Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:7ca5cd4a1d8db2b0069929720779048a203b02d85a77a7373ab37f0d30bebb58","observation_id":"4549b600-5504-494a-b6eb-d370ff47c180","resolution":{"observed_at":"2026-08-14T11:53:08.492813Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.472745Z","title":"29 E.2 Our Result Theorem E.3","venue":null,"work_id":"bef04b1b-6fb7-49ff-978f-47dee5bbccfe","year":2019},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.109701Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:c1bb2552f5f0b626a9db841820de30781c008f269a658660cacb8db6cdf512f1","observation_id":"5412a292-5656-4130-a4b8-aa392a183fa3","resolution":{"observed_at":"2026-08-14T11:53:08.477602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.457529Z","title":null,"venue":null,"work_id":"2eabffe1-596e-4e19-b21c-bcd55b6e225c","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.114782Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:4192d361fe32952fafa9cba02cb56793836fdcb4c61bfc4b2d9fe424a906071a","observation_id":"e22b7104-1f78-4fd3-991e-ddeb823c8674","resolution":{"observed_at":"2026-08-14T11:53:08.462405Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.441968Z","title":null,"venue":null,"work_id":"0ee82251-8a7d-4ae9-bf31-c93dd2f01d02","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.119411Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:8318ef91f64bed919c4c818540ef60b549c2b6ac6579779df6b12842d166c169","observation_id":"5b8ef85a-1363-493b-8052-3f29e268c46e","resolution":{"observed_at":"2026-08-14T11:53:08.447116Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.425533Z","title":"Similar to Lemma 2.6, similar conclusion hosts for {fi(x; α, m, λ, β )}n i=1","venue":null,"work_id":"36c1b97c-210b-41d0-9cb7-7af903971689","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.124145Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:6545cb154a8af7f73e7a59074a841953d4af75588f5ab059b9e7423e6e316623","observation_id":"8ba7bf39-2795-47c5-84f0-5e8f995de837","resolution":{"observed_at":"2026-08-14T11:53:08.431572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.410485Z","title":null,"venue":null,"work_id":"935ef4ed-4d96-4b84-98e7-8ba3063b6376","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.129436Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:79277a85ddda37fb62744f235a1941ae296da6e43b05f095ba6d9a5f28f30e54","observation_id":"922835ff-187e-44a9-abf5-27318e542f8a","resolution":{"observed_at":"2026-08-14T11:53:08.415380Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.394201Z","title":"For s which satisfies (31), if m − s ⁄∈ Lj and m − s + 1 ⁄∈ Lj, then the s-th element of Au is (β/γ u s)","venue":null,"work_id":"95a0d0aa-c49f-4a67-93ec-c1e7b272a1b6","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.134508Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:4b582992e1ae53a4dbec2984f953f893fe03f50c1a3ee427a970d4dd3f922f97","observation_id":"9d7c427b-68b3-42fc-af9c-4bb597f536d2","resolution":{"observed_at":"2026-08-14T11:53:08.399840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.378699Z","title":null,"venue":null,"work_id":"3a854f3d-cc5b-4cb4-a844-00ee3ac438b1","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.139122Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:69e532b5610bd616ab6ebcf37ce2ab9f59c78ab2b09c6fe1acfe180bbf9bf94f","observation_id":"0b04fe5d-8dfe-4d33-97b3-341f66f64945","resolution":{"observed_at":"2026-08-14T11:53:08.383463Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.363448Z","title":"Moreover, we have that","venue":null,"work_id":"dd57ff64-b100-48f6-9988-0d861c41fe30","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.143887Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:3b3f423f2c12b293889c5796c27be7bd5253da707e76f4e5754cb5d6ed08a16c","observation_id":"5f17672d-ca48-432a-b095-b23906a193c2","resolution":{"observed_at":"2026-08-14T11:53:08.368243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.348495Z","title":null,"venue":null,"work_id":"84765d94-ca4f-4715-bb37-717dbfca44c4","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.148655Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:70d37277fb32ac94433cbfc220f9b04986d9192b7a15e6bca2b77b0425033b46","observation_id":"4521de40-9455-4df2-86d1-482afc5cf926","resolution":{"observed_at":"2026-08-14T11:53:08.353320Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.332761Z","title":null,"venue":null,"work_id":"c105da8f-5125-4d79-8845-f73db8be1645","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.153363Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:3f7d7a47fe6c9e3f88178901da5ee8cbb01521ce40b4c0768bf807aa6eef6d60","observation_id":"ef2f5f6f-0ec9-49d8-b227-96d02e3c0a24","resolution":{"observed_at":"2026-08-14T11:53:08.337519Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.317811Z","title":null,"venue":null,"work_id":"0d8828ec-c824-4afe-b9c5-63b3f332d25d","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.158211Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:5e479320e704c3df455e2166fd8fdead01f50fb6b57250da9200bd88d51ce7b1","observation_id":"846d6c29-4d09-41b9-aafa-0a769df2ef49","resolution":{"observed_at":"2026-08-14T11:53:08.322424Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.301004Z","title":null,"venue":null,"work_id":"a030b24a-9d2d-47f3-9f17-10377ae6cdec","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.163464Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:121da9eb923a6eb29b885af345377bbf607b469ae03ffbbfa8d002f8c2c54894","observation_id":"12ec9b02-8a84-42d6-8d2b-dfc981f994bd","resolution":{"observed_at":"2026-08-14T11:53:08.306723Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.284378Z","title":"In short,","venue":null,"work_id":"ce8c13f7-f228-4f4c-8887-16b78707a3b9","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.168262Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:51169b7a34b99d08c984dc934b41a98ccd2988782e91c049a3dd74ee1931ee96","observation_id":"c08ba104-0754-43e1-83e9-3c4b4e543a41","resolution":{"observed_at":"2026-08-14T11:53:08.289095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.268495Z","title":null,"venue":null,"work_id":"880b32e5-6586-4c2f-ada9-8d3fb0df2bab","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.173170Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:54cf39c539dd2e9bf8ff6ef67b3e79241fcf92dce50f11e5f5c0d74dd560d4e0","observation_id":"c862f725-bba4-4b3c-b28f-10bb1359035d","resolution":{"observed_at":"2026-08-14T11:53:08.273460Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.252400Z","title":null,"venue":null,"work_id":"e907af9a-7c42-4330-80e4-af07be0c9cba","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.177821Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:56f3c357cb482c3b00b2d337f88a3dbf520f826108a448d143dc7d5546c8d22c","observation_id":"fa8da37a-fb73-4dfb-90dd-a3a03dffc614","resolution":{"observed_at":"2026-08-14T11:53:08.257123Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.235653Z","title":null,"venue":null,"work_id":"06640a6c-a8e3-438e-8a6d-3591ba750dd2","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.182970Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:c4949d8ebf1a6520c89228f7b83010c3d302b81e7cebe3da7586abaa83bfed74","observation_id":"96837c36-a91a-4a26-afb0-75431f371bc3","resolution":{"observed_at":"2026-08-14T11:53:08.241007Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:08.218725Z","title":"Remark E.7","venue":null,"work_id":"69d66645-fa70-49f1-9d44-9f4ab1ce0027","year":null},"citing_paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:53:08.187486Z"},"links":{"citing_paper":"/paper/1908.08394"},"observation_digest":"sha256:df063dc929579e0504d639bd8730b1eff716049c8560c0b998f230d904d778e0","observation_id":"6920c182-1d07-465a-9419-89f8ae912bee","resolution":{"observed_at":"2026-08-14T11:53:08.224852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.08394","last_updated":"2019-08-22T14:02:46Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T18:50:48.526966Z","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":0,"verified_fuzzy":10},"total_outbound_references":24},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:1908.08394."}