{"as_of":"2026-08-17T13:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:29545136a4de2d3769311dc7ebe937047329ee549b4351b09172df38b2b199e3","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-17T06:30:58.91139+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-14T11:19:57.564544Z","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-14T11:19:57.988976Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1304.7045","last_updated":"2014-02-20T13:14:59Z","snapshot_observed_at":"2026-08-15T00:19:53.649751Z","submitted_at":"2013-04-26T00:35:37Z","title":"An Algorithm for Training Polynomial Networks","version":2},"cited_work":{"arxiv_id":"1304.7045","doi":null,"metadata_source":"pith","pith_arxiv_id":"1304.7045","snapshot_observed_at":"2026-08-14T11:19:57.988976Z","title":"An Algorithm for Training Polynomial Networks","venue":"cs.LG","work_id":"80bbaaa7-7fe8-45d8-a74f-ac1216eeb32c","year":2013},"citing_paper":{"arxiv_id":"1908.09375","last_updated":"2019-08-25T19:12:56Z","snapshot_observed_at":"2026-08-16T14:14:37.578352Z","submitted_at":"2019-08-25T19:12:56Z","title":"Theoretical Issues in Deep Networks: Approximation, Optimization and Generalization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T11:19:57.564544Z"},"links":{"cited_paper":"/paper/1304.7045","citing_paper":"/paper/1908.09375"},"observation_digest":"sha256:499b664de026034490166152d5b328fe85c5377f007b550c12913bfdf4b617f9","observation_id":"208bc8b1-14a2-4577-a4e0-c5a41de187d6","resolution":{"observed_at":"2026-08-14T11:19:57.993523Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1304.7045/citation-record","integrity":"/paper/1304.7045/integrity","json":"/paper/1304.7045/citation-record.json","paper":"/paper/1304.7045"},"outbound":[],"paper":{"arxiv_id":"1304.7045","last_updated":"2014-02-20T13:14:59Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T00:19:53.649751Z","submitted_at":"2013-04-26T00:35:37Z","title":"An Algorithm for Training Polynomial Networks"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1304.7045."}