{"as_of":"2026-08-13T07:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7b1f75d40064b9d27e4c659948b43c60a8a4975844348c9381c71f2771e76908","coverage":[{"denominator":7,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T12:43:25.884016Z","state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2501.16521/citation-record","integrity":"/paper/2501.16521/integrity","json":"/paper/2501.16521/citation-record.json","paper":"/paper/2501.16521"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.08772","last_updated":"2024-12-11T20:50:29Z","snapshot_observed_at":"2026-08-12T02:32:41.323865Z","submitted_at":"2024-12-11T20:50:29Z","title":"On improving generalization in a class of learning problems with the method of small parameters for weakly-controlled optimal gradient systems","version":1},"cited_work":{"arxiv_id":"2412.08772","doi":"10.48550/arxiv.2412.08772","metadata_source":"pith","pith_arxiv_id":"2412.08772","snapshot_observed_at":"2026-08-10T18:16:17.926450Z","title":"On improving generalization in a class of learning problems with the method of small parameters for weakly-controlled optimal gradient systems","venue":"math.OC","work_id":"43bd456c-1948-41cb-ab88-44c644f8aadf","year":2024},"citing_paper":{"arxiv_id":"2501.16521","last_updated":"2025-02-06T14:54:13Z","snapshot_observed_at":"2026-08-10T12:35:23.128013Z","submitted_at":"2025-01-27T21:43:35Z","title":"On characterizing optimal learning trajectories in a class of learning problems","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T12:43:25.811639Z"},"links":{"cited_paper":"/paper/2412.08772","citing_paper":"/paper/2501.16521"},"observation_digest":"sha256:a799f28f7f1596ecd78a221bf8ebb597b11597332100b3391bed3f633eb72953","observation_id":"52665785-e2ff-4ef4-a629-264c27f1e17b","resolution":{"observed_at":"2026-08-10T12:43:25.940588Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T12:43:26.203598Z","title":"Liberzon","venue":null,"work_id":"c66c6ed2-6d09-44fe-9b75-46ef096b3592","year":2012},"citing_paper":{"arxiv_id":"2501.16521","last_updated":"2025-02-06T14:54:13Z","snapshot_observed_at":"2026-08-10T12:35:23.128013Z","submitted_at":"2025-01-27T21:43:35Z","title":"On characterizing optimal learning trajectories in a class of learning problems","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T12:43:25.837606Z"},"links":{"citing_paper":"/paper/2501.16521"},"observation_digest":"sha256:d0a8390b3fd0f88cd3d2b0b3f7f2cd9fc91369751e666c311830bdc516f25889","observation_id":"95877851-66bf-4cbc-bf1c-8a35081a38b9","resolution":{"observed_at":"2026-08-10T12:43:26.279863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T12:43:26.082405Z","title":"Pontryagin, V","venue":null,"work_id":"7039f90b-4f0f-413a-80f3-5e24ef19147c","year":1962},"citing_paper":{"arxiv_id":"2501.16521","last_updated":"2025-02-06T14:54:13Z","snapshot_observed_at":"2026-08-10T12:35:23.128013Z","submitted_at":"2025-01-27T21:43:35Z","title":"On characterizing optimal learning trajectories in a class of learning problems","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T12:43:25.853258Z"},"links":{"citing_paper":"/paper/2501.16521"},"observation_digest":"sha256:3fc79f147931b0f1632a7d49513290371ca9b0143925facd22319e38714c9c57","observation_id":"69459c8e-65f5-4f51-9c51-369905db31c5","resolution":{"observed_at":"2026-08-10T12:43:26.147252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2410.20617","last_updated":"2024-10-27T22:28:07Z","snapshot_observed_at":"2026-08-12T22:14:12.224523Z","submitted_at":"2024-10-27T22:28:07Z","title":"A successive approximation method in functional spaces for hierarchical optimal control problems and its application to learning","version":1},"cited_work":{"arxiv_id":"2410.20617","doi":"10.48550/arxiv.2410.20617","metadata_source":"pith","pith_arxiv_id":"2410.20617","snapshot_observed_at":"2026-08-10T18:16:17.926450Z","title":"A successive approximation method in functional spaces for hierarchical optimal control problems and its application to learning","venue":"math.OC","work_id":"4d1c5077-c05c-42c4-b9a0-2ee6786f102b","year":2024},"citing_paper":{"arxiv_id":"2501.16521","last_updated":"2025-02-06T14:54:13Z","snapshot_observed_at":"2026-08-10T12:35:23.128013Z","submitted_at":"2025-01-27T21:43:35Z","title":"On characterizing optimal learning trajectories in a class of learning problems","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T12:43:25.860857Z"},"links":{"cited_paper":"/paper/2410.20617","citing_paper":"/paper/2501.16521"},"observation_digest":"sha256:038e62406367a571c148ec7676a9ce1cd56f27cced2dd3d5660a8a2e179409d4","observation_id":"81aec792-e518-4052-8d65-cc0a0bbdaf93","resolution":{"observed_at":"2026-08-10T12:43:25.921636Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T12:43:25.982278Z","title":"Fleming & R.W","venue":null,"work_id":"fa78f8f3-9b94-49c7-9bb3-5461de46ac25","year":1975},"citing_paper":{"arxiv_id":"2501.16521","last_updated":"2025-02-06T14:54:13Z","snapshot_observed_at":"2026-08-10T12:35:23.128013Z","submitted_at":"2025-01-27T21:43:35Z","title":"On characterizing optimal learning trajectories in a class of learning problems","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T12:43:25.874294Z"},"links":{"citing_paper":"/paper/2501.16521"},"observation_digest":"sha256:98c5246178dd3dd68078ab7012ca6301c29c3f2c9a258474969d9cd96bed07dc","observation_id":"be0d8b2b-5805-45f6-8fa7-6aec50c6b187","resolution":{"observed_at":"2026-08-10T12:43:26.032464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T12:43:25.956198Z","title":"Clarke & R.B","venue":null,"work_id":"82a4d8a3-230a-4efb-9eec-67144884325f","year":1987},"citing_paper":{"arxiv_id":"2501.16521","last_updated":"2025-02-06T14:54:13Z","snapshot_observed_at":"2026-08-10T12:35:23.128013Z","submitted_at":"2025-01-27T21:43:35Z","title":"On characterizing optimal learning trajectories in a class of learning problems","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T12:43:25.880058Z"},"links":{"citing_paper":"/paper/2501.16521"},"observation_digest":"sha256:898959d0d50e831400b5f2542a00fef2fc77e9e0bd4831d3c461362caeb8f505","observation_id":"a99660d1-ee43-47a8-8627-33e2b785636b","resolution":{"observed_at":"2026-08-10T12:43:25.959773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T12:43:25.884016Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.16521","last_updated":"2025-02-06T14:54:13Z","snapshot_observed_at":"2026-08-10T12:35:23.128013Z","submitted_at":"2025-01-27T21:43:35Z","title":"On characterizing optimal learning trajectories in a class of learning problems","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T12:43:25.884016Z"},"links":{"citing_paper":"/paper/2501.16521"},"observation_digest":"sha256:c80bc27311bad22b05f2c1069818b3788423e2b9891be0d4fa65b8b4e734f441","observation_id":"b7b8233f-c329-4aaa-80bf-1a82bc4cf104","resolution":{"observed_at":"2026-08-10T12:43:25.884016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.16521","last_updated":"2025-02-06T14:54:13Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-10T12:35:23.128013Z","submitted_at":"2025-01-27T21:43:35Z","title":"On characterizing optimal learning trajectories in a class of learning problems"},"reference_resolution":{"displayed":7,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":2,"verified_fuzzy":4},"total_outbound_references":7},"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 7 of 7 outbound references and 0 inbound Pith citation observations for arXiv:2501.16521."}