{"as_of":"2026-08-11T14:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:26973aed0b7583863913eeabef347ca4b5d10075eb29cb6ffbeba92a7ead7705","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-11T06:34:44.6726+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-06T22:10:28.129862Z","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-06T22:10:29.833606Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.08688","last_updated":"2020-04-18T18:55:02Z","snapshot_observed_at":"2026-08-11T13:08:09.763033Z","submitted_at":"2020-04-18T18:55:02Z","title":"Lipschitz constant estimation of Neural Networks via sparse polynomial optimization","version":1},"cited_work":{"arxiv_id":"2004.08688","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.08688","snapshot_observed_at":"2026-08-06T22:10:29.833606Z","title":"Lipschitz constant estimation of Neural Networks via sparse polynomial optimization","venue":"cs.LG","work_id":"a11fe2c3-928f-4f96-86de-d25b6facb1da","year":2020},"citing_paper":{"arxiv_id":"2506.22566","last_updated":"2025-07-24T18:16:23Z","snapshot_observed_at":"2026-08-08T20:14:17.585682Z","submitted_at":"2025-06-27T18:28:41Z","title":"Exploration Behavior of Untrained Policies","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T22:10:28.129862Z"},"links":{"cited_paper":"/paper/2004.08688","citing_paper":"/paper/2506.22566"},"observation_digest":"sha256:0d203b284fc9ac57ae657ee83d6f2a08d2dafa22b4af7f62a54058b9ff6d820b","observation_id":"648b2eca-f65a-4e42-aa9b-c8e86a180c32","resolution":{"observed_at":"2026-08-06T22:10:29.933889Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2004.08688/citation-record","integrity":"/paper/2004.08688/integrity","json":"/paper/2004.08688/citation-record.json","paper":"/paper/2004.08688"},"outbound":[],"paper":{"arxiv_id":"2004.08688","last_updated":"2020-04-18T18:55:02Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T13:08:09.763033Z","submitted_at":"2020-04-18T18:55:02Z","title":"Lipschitz constant estimation of Neural Networks via sparse polynomial optimization"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2004.08688."}