{"as_of":"2026-08-05T09:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bf01152d3e47edb1fdb669f31b9f70095218a5c25fd47d2d999e30398f49b94c","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-05T06:32:48.257954+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-11T00:56:58.185552Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T05:00:54.333430Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.02046","last_updated":"2024-03-19T13:59:56Z","snapshot_observed_at":"2026-07-06T16:14:22.182217Z","submitted_at":"2023-09-05T08:47:14Z","title":"A Fast and Provable Algorithm for Sparse Phase Retrieval","version":2},"cited_work":{"arxiv_id":"2309.02046","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2309.02046","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2309.02046 , year=","venue":null,"work_id":"159a0e01-9296-4a2f-bcaa-3128ad9e4e8c","year":null},"citing_paper":{"arxiv_id":"2605.06959","last_updated":"2026-05-07T21:23:54Z","snapshot_observed_at":"2026-07-06T23:19:20.674889Z","submitted_at":"2026-05-07T21:23:54Z","title":"Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-11T00:56:58.185552Z"},"links":{"cited_paper":"/paper/2309.02046","citing_paper":"/paper/2605.06959"},"observation_digest":"sha256:4be4f5d9b7fe45b7be89d490cd6556cd76bf114f4623fcac750fee9b5f19eda1","observation_id":"50c40ba0-06de-42ca-85e2-4862f0001359","resolution":{"observed_at":"2026-05-11T05:00:54.344824Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2309.02046/citation-record","integrity":"/paper/2309.02046/integrity","json":"/paper/2309.02046/citation-record.json","paper":"/paper/2309.02046"},"outbound":[],"paper":{"arxiv_id":"2309.02046","last_updated":"2024-03-19T13:59:56Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-07-06T16:14:22.182217Z","submitted_at":"2023-09-05T08:47:14Z","title":"A Fast and Provable Algorithm for Sparse Phase Retrieval"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2309.02046."}