{"as_of":"2026-08-13T20:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f85f54efa909a02ca48d04f4447d8ef5e9ad3789eb8b7713eb1e97483a9357a7","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-12T15:16:21.040301Z","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-12T15:16:21.131087Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1504.05477","last_updated":"2015-10-30T19:35:08Z","snapshot_observed_at":"2026-07-06T04:15:36.169679Z","submitted_at":"2015-04-21T15:48:44Z","title":"Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition","version":4},"cited_work":{"arxiv_id":"1504.05477","doi":null,"metadata_source":"pith","pith_arxiv_id":"1504.05477","snapshot_observed_at":"2026-08-12T15:16:21.131087Z","title":"Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition","venue":"cs.DS","work_id":"cfaf9b21-4f78-4492-8cee-634c3fb6a604","year":2015},"citing_paper":{"arxiv_id":"2411.14578","last_updated":"2024-11-21T20:46:11Z","snapshot_observed_at":"2026-08-12T15:06:00.665959Z","submitted_at":"2024-11-21T20:46:11Z","title":"Block subspace expansions for eigenvalues and eigenvectors approximation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T15:16:21.040301Z"},"links":{"cited_paper":"/paper/1504.05477","citing_paper":"/paper/2411.14578"},"observation_digest":"sha256:a2f422d6b08db2ce0e7703c23a544155832109cff378d8388923e71b1bf68289","observation_id":"a3a6f6be-145d-4712-8e9e-3234197330c5","resolution":{"observed_at":"2026-08-12T15:16:21.135020Z","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":"1504.05477","last_updated":"2015-10-30T19:35:08Z","snapshot_observed_at":"2026-07-06T04:15:36.169679Z","submitted_at":"2015-04-21T15:48:44Z","title":"Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1504.05477","snapshot_observed_at":"2026-08-02T00:29:04.993657Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.15035","last_updated":"2026-07-16T14:15:55Z","snapshot_observed_at":"2026-08-13T15:12:28.209214Z","submitted_at":"2026-07-16T14:15:55Z","title":"A Correlation-Gap Bound for Nonlinear Gaussian PCA","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-02T00:29:04.993657Z"},"links":{"cited_paper":"/paper/1504.05477","citing_paper":"/paper/2607.15035"},"observation_digest":"sha256:b918e6649896e6d29f2f013edd6cfa1a0d1406d7683a775ec87febe2e54d527a","observation_id":"f7f8a3d7-8e40-4764-930d-d455a3f04a84","resolution":{"observed_at":"2026-08-02T00:29:04.993657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1504.05477/citation-record","integrity":"/paper/1504.05477/integrity","json":"/paper/1504.05477/citation-record.json","paper":"/paper/1504.05477"},"outbound":[],"paper":{"arxiv_id":"1504.05477","last_updated":"2015-10-30T19:35:08Z","latest_version":4,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T04:15:36.169679Z","submitted_at":"2015-04-21T15:48:44Z","title":"Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition"},"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:1504.05477."}