{"as_of":"2026-08-10T12:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6b72fb1eb0dc691c5614544f1725e98b9e9dd4e16e7cbfea1b468c5789eac92a","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:05:32.930910Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2505.20221/citation-record","integrity":"/paper/2505.20221/integrity","json":"/paper/2505.20221/citation-record.json","paper":"/paper/2505.20221"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-07T14:05:31.824218Z","title":"Adam: A method for stochastic optimization.arXiv preprint arXiv:1412.6980,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.20221","last_updated":"2025-05-26T17:03:22Z","snapshot_observed_at":"2026-08-08T23:06:57.838708Z","submitted_at":"2025-05-26T17:03:22Z","title":"Gradient Flow Matching for Learning Update Dynamics in Neural Network Training","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:05:31.824218Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2505.20221"},"observation_digest":"sha256:d617a9f39c6bc520d848e93b470746e350f7b900f5cf910abe71990c1546c353","observation_id":"ee29435d-542e-440e-9731-502ce5272c54","resolution":{"observed_at":"2026-08-07T14:05:31.824218Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.14730","last_updated":"2023-03-05T22:11:56Z","snapshot_observed_at":"2026-07-31T22:45:35.561492Z","submitted_at":"2022-11-27T05:15:42Z","title":"A Time Series is Worth 64 Words: Long-term Forecasting with Transformers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.14730","snapshot_observed_at":"2026-08-07T14:05:32.246185Z","title":"A time series is worth 64 words: Long-term forecasting with transformers.arXiv preprint arXiv:2211.14730,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.20221","last_updated":"2025-05-26T17:03:22Z","snapshot_observed_at":"2026-08-08T23:06:57.838708Z","submitted_at":"2025-05-26T17:03:22Z","title":"Gradient Flow Matching for Learning Update Dynamics in Neural Network Training","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:05:32.246185Z"},"links":{"cited_paper":"/paper/2211.14730","citing_paper":"/paper/2505.20221"},"observation_digest":"sha256:c95f4a3107183248f10e2f513be5e6dc8f6ddb617569e63711cbf8015d3ec382","observation_id":"04737efa-b80c-4a58-89a3-6a42f2684de6","resolution":{"observed_at":"2026-08-07T14:05:32.246185Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.00326","last_updated":"2020-01-15T12:38:55Z","snapshot_observed_at":"2026-08-08T12:15:50.581786Z","submitted_at":"2020-01-02T05:28:26Z","title":"NAS-Bench-201: Extending the Scope of Reproducible Neural Architecture Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.00326","snapshot_observed_at":"2026-08-07T14:05:32.664999Z","title":"Nas-bench-201: Extending the scope of reproducible neural architecture search.arXiv preprint arXiv:2001.00326,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.20221","last_updated":"2025-05-26T17:03:22Z","snapshot_observed_at":"2026-08-08T23:06:57.838708Z","submitted_at":"2025-05-26T17:03:22Z","title":"Gradient Flow Matching for Learning Update Dynamics in Neural Network Training","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:05:32.664999Z"},"links":{"cited_paper":"/paper/2001.00326","citing_paper":"/paper/2505.20221"},"observation_digest":"sha256:03541d8432b0c0de907253b7331c18f56406bdbd9766fdc64d6fcab6887f1eff","observation_id":"a5f228a7-9655-467b-89c1-12f52929a55f","resolution":{"observed_at":"2026-08-07T14:05:32.664999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:05:33.902203Z","title":"(2017) andWNNJang et al","venue":null,"work_id":"183a3dde-604b-43a5-a5fe-b1827289caf3","year":2017},"citing_paper":{"arxiv_id":"2505.20221","last_updated":"2025-05-26T17:03:22Z","snapshot_observed_at":"2026-08-08T23:06:57.838708Z","submitted_at":"2025-05-26T17:03:22Z","title":"Gradient Flow Matching for Learning Update Dynamics in Neural Network Training","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:05:32.825358Z"},"links":{"citing_paper":"/paper/2505.20221"},"observation_digest":"sha256:0f363082e3572a93e6a3d4affc3235942fc5a4a1cb68fc5ea29039771fead92b","observation_id":"23d3986e-249e-40c1-808f-bff583c22473","resolution":{"observed_at":"2026-08-07T14:05:33.992867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:05:33.738622Z","title":"For reproducibility, we generate 50 trajectories per seed across 5 random seeds (0-4), where the first 30 trajectories use the 3-layer MLP and the remaining 20 use the 2-layer MLP","venue":null,"work_id":"066300ba-e2e4-4f4a-8155-b1969cf1a2ea","year":2020},"citing_paper":{"arxiv_id":"2505.20221","last_updated":"2025-05-26T17:03:22Z","snapshot_observed_at":"2026-08-08T23:06:57.838708Z","submitted_at":"2025-05-26T17:03:22Z","title":"Gradient Flow Matching for Learning Update Dynamics in Neural Network Training","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T14:05:32.930910Z"},"links":{"citing_paper":"/paper/2505.20221"},"observation_digest":"sha256:aaac5230a6bde0b77e21329eb6e41b80c89cbb259813494ae04778a57e004fd1","observation_id":"04c799ef-131f-4160-b4ee-d17c2d62e6c2","resolution":{"observed_at":"2026-08-07T14:05:33.815752Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:05:34.123292Z","title":"Ian goodfellow, yoshua bengio, and aaron courville: Deep learning: The mit press, 2016, 800 pp, isbn: 0262035618.Genetic programming and evolvable machines, 19(1):305–307,","venue":null,"work_id":"190b777f-8549-420f-bb7e-ec0ff4b2be4f","year":2016},"citing_paper":{"arxiv_id":"2505.20221","last_updated":"2025-05-26T17:03:22Z","snapshot_observed_at":"2026-08-08T23:06:57.838708Z","submitted_at":"2025-05-26T17:03:22Z","title":"Gradient Flow Matching for Learning Update Dynamics in Neural Network Training","version":1},"reference_index":1989,"source":"pdf_text","source_observed_at":"2026-08-07T14:05:32.547521Z"},"links":{"citing_paper":"/paper/2505.20221"},"observation_digest":"sha256:b88c418b8072eca880cc10b67deca5e0cc01a6a81f8b612641d7a561f6fb3299","observation_id":"9cedefdf-c42e-4e16-a4f0-c357404858cc","resolution":{"observed_at":"2026-08-07T14:05:34.257516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.04522","last_updated":"2019-10-10T12:49:22Z","snapshot_observed_at":"2026-08-05T02:03:13.198998Z","submitted_at":"2019-10-10T12:49:22Z","title":"Probabilistic Rollouts for Learning Curve Extrapolation Across Hyperparameter Settings","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.04522","snapshot_observed_at":"2026-08-07T14:05:32.408604Z","title":"Probabilistic rollouts for learning curve extrapolation across hyperparameter settings.arXiv preprint arXiv:1910.04522,","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2505.20221","last_updated":"2025-05-26T17:03:22Z","snapshot_observed_at":"2026-08-08T23:06:57.838708Z","submitted_at":"2025-05-26T17:03:22Z","title":"Gradient Flow Matching for Learning Update Dynamics in Neural Network Training","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T14:05:32.408604Z"},"links":{"cited_paper":"/paper/1910.04522","citing_paper":"/paper/2505.20221"},"observation_digest":"sha256:cc64cfe3bb5786f6f48a7f293209bf7c8df7f25c2d0638ba5e3b2f6b6f1d9df2","observation_id":"c3dc0bfd-0805-4dc7-8c6e-70156af08052","resolution":{"observed_at":"2026-08-07T14:05:32.408604Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.01108","last_updated":"2020-03-01T02:57:50Z","snapshot_observed_at":"2026-08-07T19:07:36.327251Z","submitted_at":"2019-10-02T17:56:28Z","title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.01108","snapshot_observed_at":"2026-08-07T14:05:31.709438Z","title":"Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter.arXiv preprint arXiv:1910.01108,","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2505.20221","last_updated":"2025-05-26T17:03:22Z","snapshot_observed_at":"2026-08-08T23:06:57.838708Z","submitted_at":"2025-05-26T17:03:22Z","title":"Gradient Flow Matching for Learning Update Dynamics in Neural Network Training","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T14:05:31.709438Z"},"links":{"cited_paper":"/paper/1910.01108","citing_paper":"/paper/2505.20221"},"observation_digest":"sha256:e3c8cc08bc61bea4c85cca470bcfde326ddbf307e0d977e2d2554fa83b6d3ce0","observation_id":"67183a16-652b-41bd-bece-a1b24ea2888d","resolution":{"observed_at":"2026-08-07T14:05:31.709438Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.06264","last_updated":"2024-12-09T07:22:38Z","snapshot_observed_at":"2026-08-02T09:54:14.339169Z","submitted_at":"2024-12-09T07:22:38Z","title":"Flow Matching Guide and Code","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.06264","snapshot_observed_at":"2026-08-07T14:05:32.759351Z","title":"Flow matching guide and code.arXiv preprint arXiv:2412.06264,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.20221","last_updated":"2025-05-26T17:03:22Z","snapshot_observed_at":"2026-08-08T23:06:57.838708Z","submitted_at":"2025-05-26T17:03:22Z","title":"Gradient Flow Matching for Learning Update Dynamics in Neural Network Training","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T14:05:32.759351Z"},"links":{"cited_paper":"/paper/2412.06264","citing_paper":"/paper/2505.20221"},"observation_digest":"sha256:540b48055a028e6b4a25c3140c94ef759d2ec494b67274e73e999c6940514832","observation_id":"54dcfeed-9396-4bd8-898d-59c24ebd923c","resolution":{"observed_at":"2026-08-07T14:05:32.759351Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1704.04959","last_updated":"2017-04-17T13:23:36Z","snapshot_observed_at":"2026-07-06T05:38:05.368127Z","submitted_at":"2017-04-17T13:23:36Z","title":"Introspection: Accelerating Neural Network Training By Learning Weight Evolution","version":1},"cited_work":{"arxiv_id":"1704.04959","doi":null,"metadata_source":"pith","pith_arxiv_id":"1704.04959","snapshot_observed_at":"2026-08-07T14:05:33.286196Z","title":"Introspection: Accelerating Neural Network Training By Learning Weight Evolution","venue":"cs.LG","work_id":"ff8703f0-8037-4da6-b52b-9bfebc955011","year":2017},"citing_paper":{"arxiv_id":"2505.20221","last_updated":"2025-05-26T17:03:22Z","snapshot_observed_at":"2026-08-08T23:06:57.838708Z","submitted_at":"2025-05-26T17:03:22Z","title":"Gradient Flow Matching for Learning Update Dynamics in Neural Network Training","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T14:05:32.115254Z"},"links":{"cited_paper":"/paper/1704.04959","citing_paper":"/paper/2505.20221"},"observation_digest":"sha256:e511360181965781e12b56b8f62253d798cfe35de65b34b404cfc2dfe972c6e3","observation_id":"d3fa61ab-4da0-42f6-89fc-c112513dc4f7","resolution":{"observed_at":"2026-08-07T14:05:33.390196Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:05:32.321065Z","title":"A survey of time series foundation models: Generalizing time series representation with large language mode.arXiv preprint arXiv:2405.02358,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.20221","last_updated":"2025-05-26T17:03:22Z","snapshot_observed_at":"2026-08-08T23:06:57.838708Z","submitted_at":"2025-05-26T17:03:22Z","title":"Gradient Flow Matching for Learning Update Dynamics in Neural Network Training","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T14:05:32.321065Z"},"links":{"citing_paper":"/paper/2505.20221"},"observation_digest":"sha256:0b4ed4b07c8563229e6faf319c377ad528a7dd76a25b9819142a3c667a39caf8","observation_id":"225e93f8-dc6a-478c-a531-b1913a86d37a","resolution":{"observed_at":"2026-08-07T14:05:32.321065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.02714","last_updated":"2025-05-05T15:10:20Z","snapshot_observed_at":"2026-08-07T15:56:20.621804Z","submitted_at":"2025-05-05T15:10:20Z","title":"Less is More: Efficient Weight Farcasting with 1-Layer Neural Network","version":1},"cited_work":{"arxiv_id":"2505.02714","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.02714","snapshot_observed_at":"2026-08-07T14:05:33.485363Z","title":"Less is More: Efficient Weight Farcasting with 1-Layer Neural Network","venue":"cs.LG","work_id":"100ea748-3522-4bbe-82ed-947fb9734c30","year":2025},"citing_paper":{"arxiv_id":"2505.20221","last_updated":"2025-05-26T17:03:22Z","snapshot_observed_at":"2026-08-08T23:06:57.838708Z","submitted_at":"2025-05-26T17:03:22Z","title":"Gradient Flow Matching for Learning Update Dynamics in Neural Network Training","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T14:05:32.006857Z"},"links":{"cited_paper":"/paper/2505.02714","citing_paper":"/paper/2505.20221"},"observation_digest":"sha256:a38ca8d77644d14d6632c87e6d1f844e2dc200d08f08036a10dcae2ad3831626","observation_id":"76206885-e11a-4df8-b3e0-f21e22f0595a","resolution":{"observed_at":"2026-08-07T14:05:33.592851Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.20221","last_updated":"2025-05-26T17:03:22Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T23:06:57.838708Z","submitted_at":"2025-05-26T17:03:22Z","title":"Gradient Flow Matching for Learning Update Dynamics in Neural Network Training"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":7,"verified_exact":1,"verified_fuzzy":2},"total_outbound_references":12},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2505.20221."}