{"as_of":"2026-08-13T01:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8a4c7fb1e1e5c2688760254d3bac8d0e1583ac563b2afa39293fd54264a88b12","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-12T06:34:41.77262+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-05T12:26:58.413522Z","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-05T12:26:58.537645Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.12746","last_updated":"2025-06-23T09:42:35Z","snapshot_observed_at":"2026-08-13T00:26:10.817661Z","submitted_at":"2024-04-19T09:46:59Z","title":"Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms","version":4},"cited_work":{"arxiv_id":"2404.12746","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.12746","snapshot_observed_at":"2026-08-05T12:26:58.537645Z","title":"Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms","venue":"cs.NE","work_id":"0553ab6e-8478-4451-995a-071da9c7ff05","year":2024},"citing_paper":{"arxiv_id":"2509.01739","last_updated":"2026-06-08T12:47:08Z","snapshot_observed_at":"2026-08-06T12:00:49.661293Z","submitted_at":"2025-09-01T19:45:17Z","title":"Speeding Up the NSGA-II via Dynamic Population Sizes","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T12:26:58.413522Z"},"links":{"cited_paper":"/paper/2404.12746","citing_paper":"/paper/2509.01739"},"observation_digest":"sha256:2087a327afbb3a288bf138e409d56d3bcbfe36f12811e76d90a708491bdf76d2","observation_id":"1b39e6f7-7a0c-47eb-a7be-2502d7adcd97","resolution":{"observed_at":"2026-08-05T12:26:58.542867Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.12746/citation-record","integrity":"/paper/2404.12746/integrity","json":"/paper/2404.12746/citation-record.json","paper":"/paper/2404.12746"},"outbound":[],"paper":{"arxiv_id":"2404.12746","last_updated":"2025-06-23T09:42:35Z","latest_version":4,"primary_category":"cs.NE","snapshot_observed_at":"2026-08-13T00:26:10.817661Z","submitted_at":"2024-04-19T09:46:59Z","title":"Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2404.12746."}