{"as_of":"2026-08-18T06:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7cf10c1d70cccb69a2b3546af7718550a4a2626b7b6bc9854182081a175d4a3f","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T10:58:28.491115Z","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-05-15T19:41:32.733929Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1804.00222","last_updated":"2019-02-26T05:26:00Z","snapshot_observed_at":"2026-08-14T19:30:24.800486Z","submitted_at":"2018-03-31T22:44:28Z","title":"Meta-Learning Update Rules for Unsupervised Representation Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.00222","snapshot_observed_at":"2026-08-14T10:58:28.491115Z","title":"Learning unsupervised learning rules,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.10059","last_updated":"2019-08-27T07:26:35Z","snapshot_observed_at":"2026-08-17T20:54:55.266944Z","submitted_at":"2019-08-27T07:26:35Z","title":"MetaMixUp: Learning Adaptive Interpolation Policy of MixUp with Meta-Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T10:58:28.491115Z"},"links":{"cited_paper":"/paper/1804.00222","citing_paper":"/paper/1908.10059"},"observation_digest":"sha256:1fee31e1f724ace7dcd751a1dab7af6a314387b57041ac8592d14b792162afc7","observation_id":"2ea0d9ff-f06f-4c16-a595-9fb722d3c0ca","resolution":{"observed_at":"2026-08-14T10:58:28.491115Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.00222","last_updated":"2019-02-26T05:26:00Z","snapshot_observed_at":"2026-08-14T19:30:24.800486Z","submitted_at":"2018-03-31T22:44:28Z","title":"Meta-Learning Update Rules for Unsupervised Representation Learning","version":3},"cited_work":{"arxiv_id":"1804.00222","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.00222","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Meta-Learning Update Rules for Unsupervised Representation Learning","venue":"cs.LG","work_id":"d269e284-617d-4f5c-8f5f-0a464c645683","year":2018},"citing_paper":{"arxiv_id":"2407.04620","last_updated":"2025-08-31T18:32:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-07-05T16:23:20Z","title":"Learning to (Learn at Test Time): RNNs with Expressive Hidden States","version":4},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-15T05:20:12.134340Z"},"links":{"cited_paper":"/paper/1804.00222","citing_paper":"/paper/2407.04620"},"observation_digest":"sha256:4f5de691167fede59a12e86c0eef63b72d3e76def480a0fadf03c5028894c56a","observation_id":"753eec4c-667d-4fe7-8ae0-271a3f26166a","resolution":{"observed_at":"2026-05-15T05:20:12.325561Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.00222","last_updated":"2019-02-26T05:26:00Z","snapshot_observed_at":"2026-08-14T19:30:24.800486Z","submitted_at":"2018-03-31T22:44:28Z","title":"Meta-Learning Update Rules for Unsupervised Representation Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.00222","snapshot_observed_at":"2026-08-10T23:46:41.151592Z","title":"Metz, L., Maheswaranathan, N., Cheung, B., and Sohl-Dickstein, J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.20018","last_updated":"2024-12-28T04:41:19Z","snapshot_observed_at":"2026-08-14T21:54:20.333652Z","submitted_at":"2024-12-28T04:41:19Z","title":"Self-Assembly of a Biologically Plausible Learning Circuit","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-10T23:46:41.151592Z"},"links":{"cited_paper":"/paper/1804.00222","citing_paper":"/paper/2412.20018"},"observation_digest":"sha256:42d711b3b79a82a47c1a4ca60176bb14cef854230e63b014e0db78a53b749c89","observation_id":"521442d0-fd87-49d8-91b5-ab9094c6b147","resolution":{"observed_at":"2026-08-10T23:46:41.151592Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.00222","last_updated":"2019-02-26T05:26:00Z","snapshot_observed_at":"2026-08-14T19:30:24.800486Z","submitted_at":"2018-03-31T22:44:28Z","title":"Meta-Learning Update Rules for Unsupervised Representation Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.00222","snapshot_observed_at":"2026-08-06T14:48:49.432448Z","title":"Meta- Learning Update Rules for Unsupervised Representation Learning , February 2019 a","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.17668","last_updated":"2025-09-10T12:25:27Z","snapshot_observed_at":"2026-08-13T09:20:50.731356Z","submitted_at":"2025-07-23T16:31:38Z","title":"How Should We Meta-Learn Reinforcement Learning Algorithms?","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:49.432448Z"},"links":{"cited_paper":"/paper/1804.00222","citing_paper":"/paper/2507.17668"},"observation_digest":"sha256:32f6b2f913d2a7af9f54bd974ea21686a2e050ce225e020704ec6fe27e79a7fc","observation_id":"6ce3b857-d15e-46fb-98c2-40ec67b58731","resolution":{"observed_at":"2026-08-06T14:48:49.432448Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.00222","last_updated":"2019-02-26T05:26:00Z","snapshot_observed_at":"2026-08-14T19:30:24.800486Z","submitted_at":"2018-03-31T22:44:28Z","title":"Meta-Learning Update Rules for Unsupervised Representation Learning","version":3},"cited_work":{"arxiv_id":"1804.00222","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.00222","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Meta-Learning Update Rules for Unsupervised Representation Learning","venue":"cs.LG","work_id":"d269e284-617d-4f5c-8f5f-0a464c645683","year":2018},"citing_paper":{"arxiv_id":"2602.21204","last_updated":"2026-05-12T22:37:21Z","snapshot_observed_at":"2026-08-11T13:53:26.662684Z","submitted_at":"2026-02-24T18:59:30Z","title":"Test-Time Training with KV Binding Is Secretly Linear Attention","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-15T19:40:35.854519Z"},"links":{"cited_paper":"/paper/1804.00222","citing_paper":"/paper/2602.21204"},"observation_digest":"sha256:2a31ac08ab4f0a86737a4ec26bd1fd01561458f5f411aed268ec187845f0d4b7","observation_id":"3c5c47fa-4cb2-4c4b-825f-836eb5d4f405","resolution":{"observed_at":"2026-05-15T19:41:32.737207Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1804.00222/citation-record","integrity":"/paper/1804.00222/integrity","json":"/paper/1804.00222/citation-record.json","paper":"/paper/1804.00222"},"outbound":[],"paper":{"arxiv_id":"1804.00222","last_updated":"2019-02-26T05:26:00Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T19:30:24.800486Z","submitted_at":"2018-03-31T22:44:28Z","title":"Meta-Learning Update Rules for Unsupervised Representation Learning"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1804.00222."}