{"as_of":"2026-08-13T08:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:20fbc513c38059967820631a6ef09d48e5fde0048ea90e8c6aa9dd2076473323","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:10:59.174195Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-21T08:04:02.496683Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1712.04045","last_updated":"2021-05-25T09:50:23Z","snapshot_observed_at":"2026-08-12T21:08:09.091240Z","submitted_at":"2017-12-11T21:48:39Z","title":"Choose your path wisely: gradient descent in a Bregman distance framework","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.04045","snapshot_observed_at":"2026-08-10T22:10:59.174195Z","title":"Betcke, Matthias J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.03289","last_updated":"2025-02-28T05:35:09Z","snapshot_observed_at":"2026-08-12T18:12:56.346385Z","submitted_at":"2025-01-06T06:34:52Z","title":"Adaptive Pruning of Pretrained Transformer via Differential Inclusions","version":2},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-10T22:10:59.174195Z"},"links":{"cited_paper":"/paper/1712.04045","citing_paper":"/paper/2501.03289"},"observation_digest":"sha256:dddd3e33417cf7c086b26b94f990dfea8a0de05a85425ec300be55f9e1514e06","observation_id":"17b47be0-adfe-455d-86f9-0ed94064bbfa","resolution":{"observed_at":"2026-08-10T22:10:59.174195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1712.04045","last_updated":"2021-05-25T09:50:23Z","snapshot_observed_at":"2026-08-12T21:08:09.091240Z","submitted_at":"2017-12-11T21:48:39Z","title":"Choose your path wisely: gradient descent in a Bregman distance framework","version":3},"cited_work":{"arxiv_id":"1712.04045","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1712.04045","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Choose your path wisely: Gradient descent in a Bregman distance framework","venue":null,"work_id":"6082e33e-7344-4a42-a5a4-b93a26cb133c","year":2017},"citing_paper":{"arxiv_id":"2605.07892","last_updated":"2026-05-20T15:23:22Z","snapshot_observed_at":"2026-07-06T23:20:11.042952Z","submitted_at":"2026-05-08T15:37:24Z","title":"Adaptive Regularization for Sparsity Control in Bregman-Based Optimizers","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-11T03:27:40.899805Z"},"links":{"cited_paper":"/paper/1712.04045","citing_paper":"/paper/2605.07892"},"observation_digest":"sha256:95a6b1755cd69a4258659620559c96cab4e613b558dc4f964dd60ae49a5a7ad6","observation_id":"c5fd4e2c-5c2a-4152-8f9b-fd9b066ce987","resolution":{"observed_at":"2026-05-11T03:30:55.846653Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.04045","last_updated":"2021-05-25T09:50:23Z","snapshot_observed_at":"2026-08-12T21:08:09.091240Z","submitted_at":"2017-12-11T21:48:39Z","title":"Choose your path wisely: gradient descent in a Bregman distance framework","version":3},"cited_work":{"arxiv_id":"1712.04045","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1712.04045","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Choose your path wisely: Gradient descent in a Bregman distance framework","venue":null,"work_id":"6082e33e-7344-4a42-a5a4-b93a26cb133c","year":2017},"citing_paper":{"arxiv_id":"2605.07892","last_updated":"2026-05-20T15:23:22Z","snapshot_observed_at":"2026-07-06T23:20:11.042952Z","submitted_at":"2026-05-08T15:37:24Z","title":"Adaptive Regularization for Sparsity Control in Bregman-Based Optimizers","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-19T18:12:48.049175Z"},"links":{"cited_paper":"/paper/1712.04045","citing_paper":"/paper/2605.07892"},"observation_digest":"sha256:6ad2f4d2fc42c2d0f547fb7bc827165348b6cfe7d79ebeafaeb3ed23dce8d7ec","observation_id":"e337a99a-de1a-46f9-96b8-5403af8f9e51","resolution":{"observed_at":"2026-05-19T18:13:10.077085Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.04045","last_updated":"2021-05-25T09:50:23Z","snapshot_observed_at":"2026-08-12T21:08:09.091240Z","submitted_at":"2017-12-11T21:48:39Z","title":"Choose your path wisely: gradient descent in a Bregman distance framework","version":3},"cited_work":{"arxiv_id":"1712.04045","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1712.04045","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Choose your path wisely: Gradient descent in a Bregman distance framework","venue":null,"work_id":"6082e33e-7344-4a42-a5a4-b93a26cb133c","year":2017},"citing_paper":{"arxiv_id":"2605.07892","last_updated":"2026-05-20T15:23:22Z","snapshot_observed_at":"2026-07-06T23:20:11.042952Z","submitted_at":"2026-05-08T15:37:24Z","title":"Adaptive Regularization for Sparsity Control in Bregman-Based Optimizers","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-21T08:03:52.241338Z"},"links":{"cited_paper":"/paper/1712.04045","citing_paper":"/paper/2605.07892"},"observation_digest":"sha256:f6e9bef48aba3e287076320ef1c8ed06103c6c110249dca0b8f7924d0c58560e","observation_id":"62b7b572-8b1c-4078-924e-358e4d650dd5","resolution":{"observed_at":"2026-05-21T08:04:02.498874Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1712.04045/citation-record","integrity":"/paper/1712.04045/integrity","json":"/paper/1712.04045/citation-record.json","paper":"/paper/1712.04045"},"outbound":[],"paper":{"arxiv_id":"1712.04045","last_updated":"2021-05-25T09:50:23Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-12T21:08:09.091240Z","submitted_at":"2017-12-11T21:48:39Z","title":"Choose your path wisely: gradient descent in a Bregman distance framework"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1712.04045."}