{"as_of":"2026-08-09T08:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:339341bb6f8875f0ca413d9957118ca6d77e7dd3b2d684d94cf43116343dc330","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:13:47.855570Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.08866","last_updated":"2023-10-13T05:29:09Z","snapshot_observed_at":"2026-08-05T19:33:14.674143Z","submitted_at":"2023-10-13T05:29:09Z","title":"Adaptivity and Modularity for Efficient Generalization Over Task Complexity","version":1},"cited_work":{"arxiv_id":"2310.08866","doi":"10.48550/arxiv.2310.08866","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.08866","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"be9d9421-dc71-46da-862c-7470ce2e38ab","year":2023},"citing_paper":{"arxiv_id":"2502.05171","last_updated":"2025-02-17T17:14:04Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-07T18:55:02Z","title":"Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-12T15:39:40.845703Z"},"links":{"cited_paper":"/paper/2310.08866","citing_paper":"/paper/2502.05171"},"observation_digest":"sha256:13dffc44ab63f5d6b812c9cd620f815e0d177ec686cf9b1e6082f46b80840fab","observation_id":"e74e9ebe-e522-488f-b9a4-94ef35cf1d5f","resolution":{"observed_at":"2026-05-12T15:39:41.051862Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.08866","last_updated":"2023-10-13T05:29:09Z","snapshot_observed_at":"2026-08-05T19:33:14.674143Z","submitted_at":"2023-10-13T05:29:09Z","title":"Adaptivity and Modularity for Efficient Generalization Over Task Complexity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.08866","snapshot_observed_at":"2026-08-06T17:13:47.855570Z","title":"Adaptivity and modularity for efficient generalization over task complexity, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.11688","last_updated":"2026-06-09T18:47:26Z","snapshot_observed_at":"2026-08-09T00:53:49.389311Z","submitted_at":"2025-07-15T19:46:00Z","title":"Composing Linear Layers from Irreducibles","version":4},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T17:13:47.855570Z"},"links":{"cited_paper":"/paper/2310.08866","citing_paper":"/paper/2507.11688"},"observation_digest":"sha256:6951604b464abda3ff128b1a54ebf6bc9cb81b6b1f1159edc06d2c6574b2b6d1","observation_id":"dbec0017-4a45-4edb-bae2-c3c8e96172be","resolution":{"observed_at":"2026-08-06T17:13:47.855570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2310.08866/citation-record","integrity":"/paper/2310.08866/integrity","json":"/paper/2310.08866/citation-record.json","paper":"/paper/2310.08866"},"outbound":[],"paper":{"arxiv_id":"2310.08866","last_updated":"2023-10-13T05:29:09Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T19:33:14.674143Z","submitted_at":"2023-10-13T05:29:09Z","title":"Adaptivity and Modularity for Efficient Generalization Over Task Complexity"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2310.08866."}