{"as_of":"2026-08-19T10:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:65fe0a2262f59ff96aa216fb89bdcc9d75fee9a35dba7d80b1020cd18757f094","coverage":[{"denominator":1,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T18:14:35.321595Z","state":"measured"},{"denominator":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2508.14999/citation-record","integrity":"/paper/2508.14999/integrity","json":"/paper/2508.14999/citation-record.json","paper":"/paper/2508.14999"},"outbound":[{"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"}}],"paper":{"arxiv_id":"2508.14999","last_updated":"2025-08-20T18:38:32Z","latest_version":1,"primary_category":"q-fin.PM","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"},"reference_resolution":{"displayed":1,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":1},"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 1 of 1 outbound references and 0 inbound Pith citation observations for arXiv:2508.14999."}