{"as_of":"2026-08-16T07:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9ec759490188d2dd462ff51b184adc55dabf90a5b4d9534400ceaa9403770731","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T22:14:23.540179Z","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":"2502.11467","last_updated":"2025-02-17T05:56:11Z","snapshot_observed_at":"2026-08-14T02:16:57.419217Z","submitted_at":"2025-02-17T05:56:11Z","title":"Approximation of Permutation Invariant Polynomials by Transformers: Efficient Construction in Column-Size","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.11467","snapshot_observed_at":"2026-08-03T22:14:23.540179Z","title":"Takeshita , author M","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.12398","last_updated":"2026-07-02T01:57:13Z","snapshot_observed_at":"2026-08-14T11:43:11.689434Z","submitted_at":"2025-11-16T00:26:05Z","title":"On the Dimension-Free Approximation of Deep Neural Networks for Symmetric Korobov Functions","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-03T22:14:23.540179Z"},"links":{"cited_paper":"/paper/2502.11467","citing_paper":"/paper/2511.12398"},"observation_digest":"sha256:74b4f7d092355b22889ddf742cb9920a659280ff27d56b928b56b814db016b7b","observation_id":"139b8d2a-0424-4f1c-bf52-8da986c6cbc8","resolution":{"observed_at":"2026-08-03T22:14:23.540179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11467","last_updated":"2025-02-17T05:56:11Z","snapshot_observed_at":"2026-08-14T02:16:57.419217Z","submitted_at":"2025-02-17T05:56:11Z","title":"Approximation of Permutation Invariant Polynomials by Transformers: Efficient Construction in Column-Size","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.11467","snapshot_observed_at":"2026-08-02T21:28:33.955158Z","title":"Approximation of permutation invariant polynomials by transformers: Efficient construction in column-size.arXiv preprint arXiv:2502.11467, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.20555","last_updated":"2026-07-28T04:45:18Z","snapshot_observed_at":"2026-08-05T23:11:14.232947Z","submitted_at":"2026-02-24T05:14:01Z","title":"Standard Transformers Achieve the Minimax Rate in Nonparametric Regression with $C^{s,\\lambda}$ Targets","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-02T21:28:33.955158Z"},"links":{"cited_paper":"/paper/2502.11467","citing_paper":"/paper/2602.20555"},"observation_digest":"sha256:367a3319e09b2991d01c2a29deece3ea1d708a222b30e6c60b228a4171c74f45","observation_id":"ec702a1a-f943-401f-8d3b-7efa7b87a55f","resolution":{"observed_at":"2026-08-02T21:28:33.955158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.11467/citation-record","integrity":"/paper/2502.11467/integrity","json":"/paper/2502.11467/citation-record.json","paper":"/paper/2502.11467"},"outbound":[],"paper":{"arxiv_id":"2502.11467","last_updated":"2025-02-17T05:56:11Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T02:16:57.419217Z","submitted_at":"2025-02-17T05:56:11Z","title":"Approximation of Permutation Invariant Polynomials by Transformers: Efficient Construction in Column-Size"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2502.11467."}