{"as_of":"2026-08-13T19:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0782902b5e7f695bad8d541a23af25f8b458cfdc9c36df93819830ec850158f8","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-13T06:32:02.005865+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-11T15:14:28.497840Z","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-05T13:55:39.506701Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.20561","last_updated":"2025-03-26T13:58:02Z","snapshot_observed_at":"2026-08-07T16:35:28.758912Z","submitted_at":"2025-03-26T13:58:02Z","title":"A Theoretical Framework for Prompt Engineering: Approximating Smooth Functions with Transformer Prompts","version":1},"cited_work":{"arxiv_id":"2503.20561","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.20561","snapshot_observed_at":"2026-08-05T13:55:39.506701Z","title":"A Theoretical Framework for Prompt Engineering: Approximating Smooth Functions with Transformer Prompts","venue":"cs.LG","work_id":"762f7524-19c8-4007-ae7f-13b39b8027ea","year":2025},"citing_paper":{"arxiv_id":"2509.00421","last_updated":"2025-08-30T09:08:00Z","snapshot_observed_at":"2026-08-11T03:33:14.501107Z","submitted_at":"2025-08-30T09:08:00Z","title":"Memory Limitations of Prompt Tuning in Transformers","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T13:55:37.382618Z"},"links":{"cited_paper":"/paper/2503.20561","citing_paper":"/paper/2509.00421"},"observation_digest":"sha256:4778962422e74ff29899a310dad396c49a61a2a4c5bba2d090282cb813327013","observation_id":"42d6cf5f-f323-4985-91b5-c94a54103421","resolution":{"observed_at":"2026-08-05T13:55:39.558086Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.20561","last_updated":"2025-03-26T13:58:02Z","snapshot_observed_at":"2026-08-07T16:35:28.758912Z","submitted_at":"2025-03-26T13:58:02Z","title":"A Theoretical Framework for Prompt Engineering: Approximating Smooth Functions with Transformer Prompts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.20561","snapshot_observed_at":"2026-08-11T15:14:28.497840Z","title":"Partha Niyogi, Stephen Smale, and Shmuel Weinberger","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09558","last_updated":"2026-08-10T12:57:22Z","snapshot_observed_at":"2026-08-13T18:27:30.930276Z","submitted_at":"2026-08-10T12:57:22Z","title":"Training-Free Universal Approximation by Prompting Random Transformers","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:28.497840Z"},"links":{"cited_paper":"/paper/2503.20561","citing_paper":"/paper/2608.09558"},"observation_digest":"sha256:ae879a9689f78c6a5d1e50bac0558edaca2034863cdc23b4ae741a03d2c73a5d","observation_id":"c3e154bd-b875-46b0-aa18-f66063b44914","resolution":{"observed_at":"2026-08-11T15:14:28.497840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2503.20561/citation-record","integrity":"/paper/2503.20561/integrity","json":"/paper/2503.20561/citation-record.json","paper":"/paper/2503.20561"},"outbound":[],"paper":{"arxiv_id":"2503.20561","last_updated":"2025-03-26T13:58:02Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T16:35:28.758912Z","submitted_at":"2025-03-26T13:58:02Z","title":"A Theoretical Framework for Prompt Engineering: Approximating Smooth Functions with Transformer Prompts"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2503.20561."}