{"as_of":"2026-07-25T01:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dc6ccb4c348d5e56f59013746657dfdd31607a6f99a41c2ddd594c75a220703e","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-07-24T06:31:00.690269+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-05-19T13:15:30.397890Z","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-05-19T13:17:18.460649Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1801.03526","last_updated":"2018-03-23T23:40:46Z","snapshot_observed_at":"2026-07-06T06:18:07.297604Z","submitted_at":"2018-01-10T19:35:25Z","title":"Neural Program Synthesis with Priority Queue Training","version":2},"cited_work":{"arxiv_id":"1801.03526","doi":null,"metadata_source":"pith","pith_arxiv_id":"1801.03526","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Neural Program Synthesis with Priority Queue Training","venue":"cs.AI","work_id":"3b4f4286-9de3-4722-82b1-d4ff386d1ae4","year":2018},"citing_paper":{"arxiv_id":"2505.23383","last_updated":"2026-03-13T19:24:50Z","snapshot_observed_at":"2026-07-06T21:32:52.588223Z","submitted_at":"2025-05-29T12:04:07Z","title":"Automated Modeling Method for Pathloss Model Discovery","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-19T13:15:30.397890Z"},"links":{"cited_paper":"/paper/1801.03526","citing_paper":"/paper/2505.23383"},"observation_digest":"sha256:023e541822890ddf1186f9c1744984d10707eee8ba5f374e467d67c6e9971380","observation_id":"48498a76-2b9f-42f6-98e0-b7e12bd99db2","resolution":{"observed_at":"2026-05-19T13:17:18.463733Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1801.03526/citation-record","integrity":"/paper/1801.03526/integrity","json":"/paper/1801.03526/citation-record.json","paper":"/paper/1801.03526"},"outbound":[],"paper":{"arxiv_id":"1801.03526","last_updated":"2018-03-23T23:40:46Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T06:18:07.297604Z","submitted_at":"2018-01-10T19:35:25Z","title":"Neural Program Synthesis with Priority Queue Training"},"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-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"thesis":"As of 25 July 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1801.03526."}