Pith. sign in

Paper Citation Record · LEDGER

Adaptivity and Modularity for Efficient Generalization Over Task Complexity

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2310.08866 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-06T17:13:47.855570Z

measured 1 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

0
arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation e74e9ebe-e522-488f-b9a4-94ef35cf1d5f · inbound

Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach cites this paper.

Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach Adaptivity and Modularity for Efficient Generalization Over Task Complexity

Reference 1

Resolution
verified exact
arxiv_id, observed 2026-05-12T15:39:41.051862Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-05-12T15:39:40.845703Z digest=sha256:13dffc44ab63f5d6b812c9cd620f815e0d177ec686cf9b1e6082f46b80840fab

Observation dbec0017-4a45-4edb-bae2-c3c8e96172be · inbound

Composing Linear Layers from Irreducibles cites this paper.

Composing Linear Layers from Irreducibles Adaptivity and Modularity for Efficient Generalization Over Task Complexity

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-06T17:13:47.855570Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T17:13:47.855570Z digest=sha256:6951604b464abda3ff128b1a54ebf6bc9cb81b6b1f1159edc06d2c6574b2b6d1