{"as_of":"2026-08-09T06:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1ed85fc9756b16701da3ee5bbaadedb05a1cc0eaa1e7751fc990d6c7448d4735","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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-08-07T22:00:38.463850Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T10:43:44.794782Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1912.08957","last_updated":"2019-12-19T00:23:18Z","snapshot_observed_at":"2026-08-05T19:03:39.733993Z","submitted_at":"2019-12-19T00:23:18Z","title":"Optimization for deep learning: theory and algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.08957","snapshot_observed_at":"2026-08-07T22:00:38.463850Z","title":null,"venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2502.09319","last_updated":"2025-02-13T13:33:45Z","snapshot_observed_at":"2026-08-07T21:50:50.023118Z","submitted_at":"2025-02-13T13:33:45Z","title":"Bridging Jensen Gap for Max-Min Group Fairness Optimization in Recommendation","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T22:00:38.463850Z"},"links":{"cited_paper":"/paper/1912.08957","citing_paper":"/paper/2502.09319"},"observation_digest":"sha256:a877942130de9d56eb51a61dd9b87f3de1cba35c9f4c34c75e0804b1cf323e34","observation_id":"78d20b1f-17a6-45ad-9640-859b7bedfddf","resolution":{"observed_at":"2026-08-07T22:00:38.463850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.08957","last_updated":"2019-12-19T00:23:18Z","snapshot_observed_at":"2026-08-05T19:03:39.733993Z","submitted_at":"2019-12-19T00:23:18Z","title":"Optimization for deep learning: theory and algorithms","version":1},"cited_work":{"arxiv_id":"1912.08957","doi":null,"metadata_source":"pith","pith_arxiv_id":"1912.08957","snapshot_observed_at":"2026-08-07T10:43:44.794782Z","title":"Optimization for deep learning: theory and algorithms","venue":"cs.LG","work_id":"e43d14d1-d979-47c5-aace-27070e316ccf","year":2019},"citing_paper":{"arxiv_id":"2506.04613","last_updated":"2025-06-13T15:43:02Z","snapshot_observed_at":"2026-08-09T01:31:12.013134Z","submitted_at":"2025-06-05T04:10:52Z","title":"DeePoly: A High-Order Accuracy Scientific Machine Learning Framework for Function Approximation and Solving PDEs","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T10:43:43.996289Z"},"links":{"cited_paper":"/paper/1912.08957","citing_paper":"/paper/2506.04613"},"observation_digest":"sha256:0ce021e83dfaffd07d2c66b2c830343c4ca5668c9e5f18b99e734e1bfdbbe328","observation_id":"09673eaf-1bd1-4f24-9fed-59568c47a922","resolution":{"observed_at":"2026-08-07T10:43:44.851511Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1912.08957/citation-record","integrity":"/paper/1912.08957/integrity","json":"/paper/1912.08957/citation-record.json","paper":"/paper/1912.08957"},"outbound":[],"paper":{"arxiv_id":"1912.08957","last_updated":"2019-12-19T00:23:18Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T19:03:39.733993Z","submitted_at":"2019-12-19T00:23:18Z","title":"Optimization for deep learning: theory and algorithms"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1912.08957."}