Paper Citation Record · LEDGER

Generative Neural Operators of Log-Complexity Can Simultaneously Solve Infinitely Many Convex Programs

As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2508.14995.

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

pith.paper-citation-record.v1
2508.14995 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-05T18:14:35.321595Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-03T03:47:35.958622Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation ad0f344d-6154-4f48-ac81-42ef5d7cb6e3 · inbound

Investment Portfolio Optimization Based on Modern Portfolio Theory and Deep Learning Models cites this paper.

Investment Portfolio Optimization Based on Modern Portfolio Theory and Deep Learning Models Generative Neural Operators of Log-Complexity Can Simultaneously Solve Infinitely Many Convex Programs

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-05T18:14:35.321595Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3636c9e6-dcfe-49a8-9f24-a44423828b5f · inbound

Adaptivity Under Realizability Constraints: Comparing In-Context and Agentic Learning cites this paper.

Adaptivity Under Realizability Constraints: Comparing In-Context and Agentic Learning Generative Neural Operators of Log-Complexity Can Simultaneously Solve Infinitely Many Convex Programs

Reference 23

Resolution: verified exact; arxiv_id, observed 2026-05-11T17:51:09.343343Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 67240021-9e59-4241-8d32-9ec700b3dcb1 · inbound

Weighted universal approximation of differentiable maps on infinite-dimensional manifolds cites this paper.

Weighted universal approximation of differentiable maps on infinite-dimensional manifolds Generative Neural Operators of Log-Complexity Can Simultaneously Solve Infinitely Many Convex Programs

Reference 66

Resolution: verified exact; arxiv_id, observed 2026-07-03T03:47:35.959979Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 69bf4ed9-3104-41d9-b4d2-6c5f4880815f · inbound

Weighted universal approximation of differentiable maps on infinite-dimensional manifolds cites this paper.

Weighted universal approximation of differentiable maps on infinite-dimensional manifolds Generative Neural Operators of Log-Complexity Can Simultaneously Solve Infinitely Many Convex Programs

Reference 69

Resolution: verified exact; arxiv_id, observed 2026-06-30T11:34:37.554754Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.