{"as_of":"2026-08-19T21:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c5f5425530254d6acfe32d45143bf61a8f2ca1cd9243eaf7f71009fe5e61abd9","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":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":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T13:07:41.787989Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T13:07:41.888474Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.23536","last_updated":"2024-10-31T00:56:47Z","snapshot_observed_at":"2026-08-17T16:10:15.501875Z","submitted_at":"2024-10-31T00:56:47Z","title":"On Cost-Sensitive Distributionally Robust Log-Optimal Portfolio","version":1},"cited_work":{"arxiv_id":"2410.23536","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.23536","snapshot_observed_at":"2026-08-05T13:07:41.888474Z","title":"On Cost-Sensitive Distributionally Robust Log-Optimal Portfolio","venue":"math.OC","work_id":"ff1b96e2-e092-490e-a490-88c08062f174","year":2024},"citing_paper":{"arxiv_id":"2509.01076","last_updated":"2025-09-01T02:32:16Z","snapshot_observed_at":"2026-08-12T16:50:38.478024Z","submitted_at":"2025-09-01T02:32:16Z","title":"Is Noisy Data a Blessing in Disguise? A Distributionally Robust Optimization Perspective","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T13:07:41.787989Z"},"links":{"cited_paper":"/paper/2410.23536","citing_paper":"/paper/2509.01076"},"observation_digest":"sha256:ae01f12c8635a3017cba49fcb105210fc8e076120cc0c888f53d40f1fe3f5cc3","observation_id":"8b4d16d3-6761-481f-a2b8-5ec3c3df1579","resolution":{"observed_at":"2026-08-05T13:07:41.892299Z","resolver_source":"local_arxiv","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/2410.23536/citation-record","integrity":"/paper/2410.23536/integrity","json":"/paper/2410.23536/citation-record.json","paper":"/paper/2410.23536"},"outbound":[],"paper":{"arxiv_id":"2410.23536","last_updated":"2024-10-31T00:56:47Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-17T16:10:15.501875Z","submitted_at":"2024-10-31T00:56:47Z","title":"On Cost-Sensitive Distributionally Robust Log-Optimal Portfolio"},"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 1 inbound Pith citation observation for arXiv:2410.23536."}