{"as_of":"2026-08-09T05:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:049d6853ebcc550a6d76d063c9df3eec3d7a4d4de39cd1591241039bab90bdcf","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-08T06:32:00.761636+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-07-30T11:11:55.636276Z","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":"2303.07279","last_updated":"2025-04-07T13:06:40Z","snapshot_observed_at":"2026-08-05T07:44:30.750690Z","submitted_at":"2023-03-13T16:54:04Z","title":"Universal coding, intrinsic volumes, and metric complexity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.07279","snapshot_observed_at":"2026-07-30T11:11:55.636276Z","title":"arXiv preprint arXiv:2303.07279 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23836","last_updated":"2026-07-26T20:42:39Z","snapshot_observed_at":"2026-08-08T06:54:09.582022Z","submitted_at":"2026-07-26T20:42:39Z","title":"Elementary Symmetric Polynomial Inequalities for Centered Vectors and Matrices","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-07-30T11:11:55.636276Z"},"links":{"cited_paper":"/paper/2303.07279","citing_paper":"/paper/2607.23836"},"observation_digest":"sha256:43108e0f61a29da62b816d4dfc3a68302cebeb9bea2ffc2f5a791cd3185b884e","observation_id":"be36fa9c-6cb5-489d-abf7-4b14e687163b","resolution":{"observed_at":"2026-07-30T11:11:55.636276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2303.07279/citation-record","integrity":"/paper/2303.07279/integrity","json":"/paper/2303.07279/citation-record.json","paper":"/paper/2303.07279"},"outbound":[],"paper":{"arxiv_id":"2303.07279","last_updated":"2025-04-07T13:06:40Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-05T07:44:30.750690Z","submitted_at":"2023-03-13T16:54:04Z","title":"Universal coding, intrinsic volumes, and metric complexity"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2303.07279."}