{"as_of":"2026-08-06T18:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fccc20f0409f34968b87f952bab67941d11a039149bf2b0218010f0797aad9f8","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-30T22:19:23.705339Z","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-07-01T14:05:46.498138Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1702.03849","last_updated":"2017-06-04T04:26:02Z","snapshot_observed_at":"2026-07-06T05:29:49.720370Z","submitted_at":"2017-02-13T16:11:38Z","title":"Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysis","version":3},"cited_work":{"arxiv_id":"1702.03849","doi":null,"metadata_source":"pith","pith_arxiv_id":"1702.03849","snapshot_observed_at":"2026-07-01T14:05:46.498138Z","title":"Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysis","venue":"cs.LG","work_id":"c85a76d4-4b28-4ff9-962d-21916e26f62b","year":2017},"citing_paper":{"arxiv_id":"1906.11148","last_updated":"2019-06-26T15:05:24Z","snapshot_observed_at":"2026-07-06T08:03:00.197350Z","submitted_at":"2019-06-26T15:05:24Z","title":"Chaining Meets Chain Rule: Multilevel Entropic Regularization and Training of Neural Nets","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-25T15:45:38.743857Z"},"links":{"cited_paper":"/paper/1702.03849","citing_paper":"/paper/1906.11148"},"observation_digest":"sha256:56bbbe2e9af7803a0988159fa13534abd73032a0618d7e2d19e36ca64d4f55b3","observation_id":"cdc47fcf-6f36-43eb-9202-2f929d2881b1","resolution":{"observed_at":"2026-05-25T15:45:59.328867Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1702.03849","last_updated":"2017-06-04T04:26:02Z","snapshot_observed_at":"2026-07-06T05:29:49.720370Z","submitted_at":"2017-02-13T16:11:38Z","title":"Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysis","version":3},"cited_work":{"arxiv_id":"1702.03849","doi":null,"metadata_source":"pith","pith_arxiv_id":"1702.03849","snapshot_observed_at":"2026-07-01T14:05:46.498138Z","title":"Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysis","venue":"cs.LG","work_id":"c85a76d4-4b28-4ff9-962d-21916e26f62b","year":2017},"citing_paper":{"arxiv_id":"1907.04450","last_updated":"2019-07-09T22:46:41Z","snapshot_observed_at":"2026-07-06T08:06:41.065536Z","submitted_at":"2019-07-09T22:46:41Z","title":"SNAP: Finding Approximate Second-Order Stationary Solutions Efficiently for Non-convex Linearly Constrained Problems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-25T00:04:27.970787Z"},"links":{"cited_paper":"/paper/1702.03849","citing_paper":"/paper/1907.04450"},"observation_digest":"sha256:be2735d7ddcce9952eb2e5b399531a0c4cf14620ae9adac316ef14ac1f3659d1","observation_id":"36b8c910-5868-435f-912a-66ab842d4859","resolution":{"observed_at":"2026-05-25T00:05:06.643350Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1702.03849","last_updated":"2017-06-04T04:26:02Z","snapshot_observed_at":"2026-07-06T05:29:49.720370Z","submitted_at":"2017-02-13T16:11:38Z","title":"Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysis","version":3},"cited_work":{"arxiv_id":"1702.03849","doi":null,"metadata_source":"pith","pith_arxiv_id":"1702.03849","snapshot_observed_at":"2026-07-01T14:05:46.498138Z","title":"Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysis","venue":"cs.LG","work_id":"c85a76d4-4b28-4ff9-962d-21916e26f62b","year":2017},"citing_paper":{"arxiv_id":"2605.11170","last_updated":"2026-06-02T13:57:02Z","snapshot_observed_at":"2026-08-02T02:13:17.912919Z","submitted_at":"2026-05-11T19:28:33Z","title":"Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Data","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-30T22:19:23.705339Z"},"links":{"cited_paper":"/paper/1702.03849","citing_paper":"/paper/2605.11170"},"observation_digest":"sha256:38612e34576fc9553d7f34dc95795a31437851b1180c14cbe9449ffecd33196a","observation_id":"74e0e55b-5266-44aa-9a52-00914ee8e115","resolution":{"observed_at":"2026-07-01T14:05:46.499582Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1702.03849/citation-record","integrity":"/paper/1702.03849/integrity","json":"/paper/1702.03849/citation-record.json","paper":"/paper/1702.03849"},"outbound":[],"paper":{"arxiv_id":"1702.03849","last_updated":"2017-06-04T04:26:02Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T05:29:49.720370Z","submitted_at":"2017-02-13T16:11:38Z","title":"Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysis"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1702.03849."}