{"as_of":"2026-08-09T15:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:07f4c239b7eb6e517422bb597634067d37732e428b16eeede219f9d3c3164119","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-09T06:31:02.800959+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-08T16:39:14.146711Z","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-07T15:11:06.296716Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.00406","last_updated":"2023-06-01T07:12:00Z","snapshot_observed_at":"2026-08-05T08:31:53.334547Z","submitted_at":"2023-06-01T07:12:00Z","title":"Faster Robust Tensor Power Method for Arbitrary Order","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.00406","snapshot_observed_at":"2026-08-08T16:39:14.146711Z","title":"Faster robust tensor power method for arbitrary order","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06167","last_updated":"2025-02-10T05:36:30Z","snapshot_observed_at":"2026-08-09T01:42:08.911908Z","submitted_at":"2025-02-10T05:36:30Z","title":"Universal Approximation of Visual Autoregressive Transformers","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T16:39:14.146711Z"},"links":{"cited_paper":"/paper/2306.00406","citing_paper":"/paper/2502.06167"},"observation_digest":"sha256:694954f4404ee3d745926f70814eb7fd5bcba80e9cfab341d09fcbd3206f68d8","observation_id":"45a08f1f-0a95-4241-afe6-76e2d069d4cb","resolution":{"observed_at":"2026-08-08T16:39:14.146711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.00406","last_updated":"2023-06-01T07:12:00Z","snapshot_observed_at":"2026-08-05T08:31:53.334547Z","submitted_at":"2023-06-01T07:12:00Z","title":"Faster Robust Tensor Power Method for Arbitrary Order","version":1},"cited_work":{"arxiv_id":"2306.00406","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.00406","snapshot_observed_at":"2026-08-07T15:11:06.296716Z","title":"Faster Robust Tensor Power Method for Arbitrary Order","venue":"cs.LG","work_id":"3145ce8b-84aa-4800-82ed-bc394a02ba8d","year":2023},"citing_paper":{"arxiv_id":"2505.16284","last_updated":"2025-05-22T06:26:28Z","snapshot_observed_at":"2026-08-07T22:03:10.571335Z","submitted_at":"2025-05-22T06:26:28Z","title":"Only Large Weights (And Not Skip Connections) Can Prevent the Perils of Rank Collapse","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:58.679033Z"},"links":{"cited_paper":"/paper/2306.00406","citing_paper":"/paper/2505.16284"},"observation_digest":"sha256:92ad06bae7fbe726ad23b0afdb48f30196bcac624ae8b71076af5bcce0090d3d","observation_id":"eadad6f9-9605-421c-a73a-39a129b31740","resolution":{"observed_at":"2026-08-07T15:11:06.390357Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2306.00406/citation-record","integrity":"/paper/2306.00406/integrity","json":"/paper/2306.00406/citation-record.json","paper":"/paper/2306.00406"},"outbound":[],"paper":{"arxiv_id":"2306.00406","last_updated":"2023-06-01T07:12:00Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T08:31:53.334547Z","submitted_at":"2023-06-01T07:12:00Z","title":"Faster Robust Tensor Power Method for Arbitrary Order"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2306.00406."}