{"as_of":"2026-08-09T03:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c9376e497d5222a30d79137fd53c90859c036ce44fc4700da749db21e1d8edce","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-08T06:32:00.761636+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-08-07T13:33:52.282275Z","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-14T19:59:25.815548Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1911.02590","last_updated":"2019-11-06T19:04:16Z","snapshot_observed_at":"2026-07-06T08:35:15.491391Z","submitted_at":"2019-11-06T19:04:16Z","title":"Optimizing Millions of Hyperparameters by Implicit Differentiation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.02590","snapshot_observed_at":"2026-08-07T13:33:52.282275Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.21598","last_updated":"2025-05-27T16:56:54Z","snapshot_observed_at":"2026-08-07T13:26:02.241328Z","submitted_at":"2025-05-27T16:56:54Z","title":"Rethinking Data Mixture for Large Language Models: A Comprehensive Survey and New Perspectives","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T13:33:52.282275Z"},"links":{"cited_paper":"/paper/1911.02590","citing_paper":"/paper/2505.21598"},"observation_digest":"sha256:a3d472f17a48bd1e52d5420d87835bf344b5741e4a275ca19a7828eb1f222645","observation_id":"5b8c3ab1-ee23-4537-86aa-73cb9e83704b","resolution":{"observed_at":"2026-08-07T13:33:52.282275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.02590","last_updated":"2019-11-06T19:04:16Z","snapshot_observed_at":"2026-07-06T08:35:15.491391Z","submitted_at":"2019-11-06T19:04:16Z","title":"Optimizing Millions of Hyperparameters by Implicit Differentiation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.02590","snapshot_observed_at":"2026-08-06T05:46:43.273021Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.01325","last_updated":"2025-08-02T11:32:47Z","snapshot_observed_at":"2026-08-08T05:12:32.804440Z","submitted_at":"2025-08-02T11:32:47Z","title":"Fusion Sampling Validation in Data Partitioning for Machine Learning","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T05:46:43.273021Z"},"links":{"cited_paper":"/paper/1911.02590","citing_paper":"/paper/2508.01325"},"observation_digest":"sha256:a39a9049f2625dd4ace7caf09e91fd4c32838f0b60bf54f184e7b624c7e1cdd0","observation_id":"49f2052f-1cc3-46dd-b34a-224b76b1fcac","resolution":{"observed_at":"2026-08-06T05:46:43.273021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.02590","last_updated":"2019-11-06T19:04:16Z","snapshot_observed_at":"2026-07-06T08:35:15.491391Z","submitted_at":"2019-11-06T19:04:16Z","title":"Optimizing Millions of Hyperparameters by Implicit Differentiation","version":1},"cited_work":{"arxiv_id":"1911.02590","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.02590","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lorraine, P","venue":null,"work_id":"9a4fb608-324f-46df-95a3-ead46c8b02ab","year":1911},"citing_paper":{"arxiv_id":"2605.12718","last_updated":"2026-05-12T20:26:41Z","snapshot_observed_at":"2026-08-02T04:56:08.043773Z","submitted_at":"2026-05-12T20:26:41Z","title":"CHAL: Council of Hierarchical Agentic Language","version":1},"reference_index":108,"source":"pdf_text","source_observed_at":"2026-05-14T19:59:13.378797Z"},"links":{"cited_paper":"/paper/1911.02590","citing_paper":"/paper/2605.12718"},"observation_digest":"sha256:fd62865ef90dc88b6d0e0ba9944e70c7ba388b0a4c14ee1590bd480c59537235","observation_id":"13a57de3-0001-42ef-bf5e-edae280c6355","resolution":{"observed_at":"2026-05-14T19:59:25.818682Z","resolver_source":"arxiv_id","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/1911.02590/citation-record","integrity":"/paper/1911.02590/integrity","json":"/paper/1911.02590/citation-record.json","paper":"/paper/1911.02590"},"outbound":[],"paper":{"arxiv_id":"1911.02590","last_updated":"2019-11-06T19:04:16Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T08:35:15.491391Z","submitted_at":"2019-11-06T19:04:16Z","title":"Optimizing Millions of Hyperparameters by Implicit Differentiation"},"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 3 inbound Pith citation observations for arXiv:1911.02590."}