{"as_of":"2026-08-06T08:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4ffe42d57be9cc8a87cd27e8ec6bc6cf279264d09090f3802700054401da1f96","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-06T06:34:29.942622+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-03T20:21:03.617029Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2404.01617","last_updated":"2024-10-22T04:09:15Z","snapshot_observed_at":"2026-08-06T00:33:39.168732Z","submitted_at":"2024-04-02T03:43:55Z","title":"Designing Network Algorithms via Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.01617","snapshot_observed_at":"2026-08-03T20:21:03.617029Z","title":"Designing network algorithms via large language models.arXiv preprint arXiv:2404.01617, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.20333","last_updated":"2025-11-25T14:10:44Z","snapshot_observed_at":"2026-08-03T20:21:00.893019Z","submitted_at":"2025-11-25T14:10:44Z","title":"NNGPT: Rethinking AutoML with Large Language Models","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T20:21:03.617029Z"},"links":{"cited_paper":"/paper/2404.01617","citing_paper":"/paper/2511.20333"},"observation_digest":"sha256:86ae07f72227834e8af103df16e3f298584edae510742c20ef5f11f1d224f4fd","observation_id":"aee0abe8-066b-438b-8a58-f7b6a005a41d","resolution":{"observed_at":"2026-08-03T20:21:03.617029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2404.01617/citation-record","integrity":"/paper/2404.01617/integrity","json":"/paper/2404.01617/citation-record.json","paper":"/paper/2404.01617"},"outbound":[],"paper":{"arxiv_id":"2404.01617","last_updated":"2024-10-22T04:09:15Z","latest_version":2,"primary_category":"cs.NI","snapshot_observed_at":"2026-08-06T00:33:39.168732Z","submitted_at":"2024-04-02T03:43:55Z","title":"Designing Network Algorithms via Large Language Models"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2404.01617."}