{"as_of":"2026-08-19T23:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:76f4376214475334dcb814fe787885d0bac41229d79b8a270039d05f31aa1a17","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T18:14:35.321595Z","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-07-03T03:47:35.958622Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.14995","last_updated":"2025-08-20T18:32:36Z","snapshot_observed_at":"2026-08-10T08:23:22.653386Z","submitted_at":"2025-08-20T18:32:36Z","title":"Generative Neural Operators of Log-Complexity Can Simultaneously Solve Infinitely Many Convex Programs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.14995","snapshot_observed_at":"2026-08-05T18:14:35.321595Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.14999","last_updated":"2025-08-20T18:38:32Z","snapshot_observed_at":"2026-08-09T23:42:59.893039Z","submitted_at":"2025-08-20T18:38:32Z","title":"Investment Portfolio Optimization Based on Modern Portfolio Theory and Deep Learning Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T18:14:35.321595Z"},"links":{"cited_paper":"/paper/2508.14995","citing_paper":"/paper/2508.14999"},"observation_digest":"sha256:faba6ee22e7463b3397b8bfef27e71395c7c7c3b4985442c56292cb48aa541a2","observation_id":"ad0f344d-6154-4f48-ac81-42ef5d7cb6e3","resolution":{"observed_at":"2026-08-05T18:14:35.321595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14995","last_updated":"2025-08-20T18:32:36Z","snapshot_observed_at":"2026-08-10T08:23:22.653386Z","submitted_at":"2025-08-20T18:32:36Z","title":"Generative Neural Operators of Log-Complexity Can Simultaneously Solve Infinitely Many Convex Programs","version":1},"cited_work":{"arxiv_id":"2508.14995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.14995","snapshot_observed_at":"2026-07-03T03:47:35.958622Z","title":"Kratsios, A","venue":null,"work_id":"78700d45-1fdc-44c8-9b63-669a6280356b","year":2025},"citing_paper":{"arxiv_id":"2605.04995","last_updated":"2026-05-06T14:53:55Z","snapshot_observed_at":"2026-08-17T03:52:50.094532Z","submitted_at":"2026-05-06T14:53:55Z","title":"Adaptivity Under Realizability Constraints: Comparing In-Context and Agentic Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-08T17:00:37.250246Z"},"links":{"cited_paper":"/paper/2508.14995","citing_paper":"/paper/2605.04995"},"observation_digest":"sha256:7e694fad6d39ce53679ab1a22486c46568a8b56786136d024a5b3fa1f51d4dd0","observation_id":"3636c9e6-dcfe-49a8-9f24-a44423828b5f","resolution":{"observed_at":"2026-05-11T17:51:09.343343Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14995","last_updated":"2025-08-20T18:32:36Z","snapshot_observed_at":"2026-08-10T08:23:22.653386Z","submitted_at":"2025-08-20T18:32:36Z","title":"Generative Neural Operators of Log-Complexity Can Simultaneously Solve Infinitely Many Convex Programs","version":1},"cited_work":{"arxiv_id":"2508.14995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.14995","snapshot_observed_at":"2026-07-03T03:47:35.958622Z","title":"Kratsios, A","venue":null,"work_id":"78700d45-1fdc-44c8-9b63-669a6280356b","year":2025},"citing_paper":{"arxiv_id":"2606.09820","last_updated":"2026-06-27T21:12:48Z","snapshot_observed_at":"2026-08-18T03:43:24.573943Z","submitted_at":"2026-06-08T17:57:40Z","title":"Weighted universal approximation of differentiable maps on infinite-dimensional manifolds","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-06-27T14:34:43.143213Z"},"links":{"cited_paper":"/paper/2508.14995","citing_paper":"/paper/2606.09820"},"observation_digest":"sha256:89a118fe9761b8a2217c18119dc41edc25ae490988f4cd416e6fb742734c3b5d","observation_id":"67240021-9e59-4241-8d32-9ec700b3dcb1","resolution":{"observed_at":"2026-07-03T03:47:35.959979Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14995","last_updated":"2025-08-20T18:32:36Z","snapshot_observed_at":"2026-08-10T08:23:22.653386Z","submitted_at":"2025-08-20T18:32:36Z","title":"Generative Neural Operators of Log-Complexity Can Simultaneously Solve Infinitely Many Convex Programs","version":1},"cited_work":{"arxiv_id":"2508.14995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.14995","snapshot_observed_at":"2026-07-03T03:47:35.958622Z","title":"Kratsios, A","venue":null,"work_id":"78700d45-1fdc-44c8-9b63-669a6280356b","year":2025},"citing_paper":{"arxiv_id":"2606.09820","last_updated":"2026-06-27T21:12:48Z","snapshot_observed_at":"2026-08-18T03:43:24.573943Z","submitted_at":"2026-06-08T17:57:40Z","title":"Weighted universal approximation of differentiable maps on infinite-dimensional manifolds","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-06-30T11:33:21.411554Z"},"links":{"cited_paper":"/paper/2508.14995","citing_paper":"/paper/2606.09820"},"observation_digest":"sha256:03c79c842513925192ecdf9d178fefb50eff7463ba60aa302daffc5e7fb5321b","observation_id":"69bf4ed9-3104-41d9-b4d2-6c5f4880815f","resolution":{"observed_at":"2026-06-30T11:34:37.554754Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.14995/citation-record","integrity":"/paper/2508.14995/integrity","json":"/paper/2508.14995/citation-record.json","paper":"/paper/2508.14995"},"outbound":[],"paper":{"arxiv_id":"2508.14995","last_updated":"2025-08-20T18:32:36Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T08:23:22.653386Z","submitted_at":"2025-08-20T18:32:36Z","title":"Generative Neural Operators of Log-Complexity Can Simultaneously Solve Infinitely Many Convex Programs"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"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."}