{"as_of":"2026-08-10T13:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e049cb94ae143035b3c7cde0d59983a325510a08c8260a560ce44ec1c8a6cd1a","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T07:08:16.892784Z","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-07-07T13:23:47.459201Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1211.1002","last_updated":"2012-11-05T20:53:18Z","snapshot_observed_at":"2026-07-06T02:59:11.004249Z","submitted_at":"2012-11-05T20:53:18Z","title":"OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings","version":1},"cited_work":{"arxiv_id":"1211.1002","doi":null,"metadata_source":"pith","pith_arxiv_id":"1211.1002","snapshot_observed_at":"2026-07-07T13:23:47.459201Z","title":"OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings","venue":"cs.DS","work_id":"2b5089e8-e025-4b39-9566-fd4b577b2699","year":2012},"citing_paper":{"arxiv_id":"2606.20082","last_updated":"2026-06-18T11:00:03Z","snapshot_observed_at":"2026-07-06T23:55:15.440382Z","submitted_at":"2026-06-18T11:00:03Z","title":"Beyond Averaging in John Ellipsoid Approximation: High-Accuracy Algorithms in the Leverage-Score Model","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-06-26T16:21:09.095664Z"},"links":{"cited_paper":"/paper/1211.1002","citing_paper":"/paper/2606.20082"},"observation_digest":"sha256:d5cd1f62a04598c7fb5e3021f712aeecef8b62392a42f702c2be37c3fe480fe0","observation_id":"fe7736c1-8347-4198-8710-e3dbb1cd9e6f","resolution":{"observed_at":"2026-07-04T05:09:36.195143Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1211.1002","last_updated":"2012-11-05T20:53:18Z","snapshot_observed_at":"2026-07-06T02:59:11.004249Z","submitted_at":"2012-11-05T20:53:18Z","title":"OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings","version":1},"cited_work":{"arxiv_id":"1211.1002","doi":null,"metadata_source":"pith","pith_arxiv_id":"1211.1002","snapshot_observed_at":"2026-07-07T13:23:47.459201Z","title":"OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings","venue":"cs.DS","work_id":"2b5089e8-e025-4b39-9566-fd4b577b2699","year":2012},"citing_paper":{"arxiv_id":"2607.05384","last_updated":"2026-07-08T16:03:41Z","snapshot_observed_at":"2026-08-08T17:30:02.979918Z","submitted_at":"2026-07-06T17:56:16Z","title":"Well-invertible column subsets of sparse matrices are rare","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-07T13:18:26.809614Z"},"links":{"cited_paper":"/paper/1211.1002","citing_paper":"/paper/2607.05384"},"observation_digest":"sha256:d36b2c48b919da0b701fa9ecf64e3424f0a4d8c393301d106f633ddbf0415c83","observation_id":"57212ca9-ce43-4335-aa1f-4ed1651a8145","resolution":{"observed_at":"2026-07-07T13:23:47.460670Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1211.1002","last_updated":"2012-11-05T20:53:18Z","snapshot_observed_at":"2026-07-06T02:59:11.004249Z","submitted_at":"2012-11-05T20:53:18Z","title":"OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1211.1002","snapshot_observed_at":"2026-07-11T07:08:16.892784Z","title":"Nguyen,OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings, arXiv:1211.1002, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.05384","last_updated":"2026-07-08T16:03:41Z","snapshot_observed_at":"2026-08-08T17:30:02.979918Z","submitted_at":"2026-07-06T17:56:16Z","title":"Well-invertible column subsets of sparse matrices are rare","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-11T07:08:16.892784Z"},"links":{"cited_paper":"/paper/1211.1002","citing_paper":"/paper/2607.05384"},"observation_digest":"sha256:6d9cd6fd66dd2b65cf1a65125ecf4cedaf4ef55c629d537b28169f6dcaf8a0c8","observation_id":"4c11ba22-7ec1-43ab-b40f-b454a5177048","resolution":{"observed_at":"2026-07-11T07:08:16.892784Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1211.1002/citation-record","integrity":"/paper/1211.1002/integrity","json":"/paper/1211.1002/citation-record.json","paper":"/paper/1211.1002"},"outbound":[],"paper":{"arxiv_id":"1211.1002","last_updated":"2012-11-05T20:53:18Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T02:59:11.004249Z","submitted_at":"2012-11-05T20:53:18Z","title":"OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1211.1002."}