{"as_of":"2026-08-09T03:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:937b81a01e6a3d45fd3505a65e2f58d2ff56ccbdb76d4a899245f58ebfaa798d","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T14:36:50.224357Z","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.461891Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.08773","last_updated":"2025-04-28T20:23:39Z","snapshot_observed_at":"2026-07-06T19:49:52.926290Z","submitted_at":"2024-11-13T16:58:51Z","title":"Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.08773","snapshot_observed_at":"2026-08-05T14:36:50.224357Z","title":"C HENAKKOD , M","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:50.224357Z"},"links":{"cited_paper":"/paper/2411.08773","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:dadb1cb9fbd0252385c8fa0e29d06afdaed1c2723b475b634256bccdf90ef16f","observation_id":"00c0ce53-d1d8-4979-a92f-d3288132c8a0","resolution":{"observed_at":"2026-08-05T14:36:50.224357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.08773","last_updated":"2025-04-28T20:23:39Z","snapshot_observed_at":"2026-07-06T19:49:52.926290Z","submitted_at":"2024-11-13T16:58:51Z","title":"Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.08773","snapshot_observed_at":"2026-07-14T23:11:18.736508Z","title":"Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity.arXiv preprint arXiv:2411.08773, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.11009","last_updated":"2026-06-29T15:06:58Z","snapshot_observed_at":"2026-08-07T05:31:01.294083Z","submitted_at":"2026-03-11T17:31:52Z","title":"Linear-Scaling Tensor Train Sketching","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T23:11:18.736508Z"},"links":{"cited_paper":"/paper/2411.08773","citing_paper":"/paper/2603.11009"},"observation_digest":"sha256:f18890afd0a0a9fb60f41e4f5c7017bfd7dc8a1ab5325e7f1610bb66e502f103","observation_id":"1f3aceeb-ffbc-40ad-9531-a34aa11bba8f","resolution":{"observed_at":"2026-07-14T23:11:18.736508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.08773","last_updated":"2025-04-28T20:23:39Z","snapshot_observed_at":"2026-07-06T19:49:52.926290Z","submitted_at":"2024-11-13T16:58:51Z","title":"Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.08773","snapshot_observed_at":"2026-07-11T21:57:05.771091Z","title":"Optimal oblivious subspace embeddings with near-optimal sparsity.arXiv preprint arXiv:2411.08773, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"cited_paper":"/paper/2411.08773","citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:d1d3b6f361e000d862f20310d21a974386de30985f12f544b58130b8a24b1f2f","observation_id":"63e62678-b50d-49a1-afae-0a208567b94a","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.08773","last_updated":"2025-04-28T20:23:39Z","snapshot_observed_at":"2026-07-06T19:49:52.926290Z","submitted_at":"2024-11-13T16:58:51Z","title":"Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity","version":2},"cited_work":{"arxiv_id":"2411.08773","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.08773","snapshot_observed_at":"2026-07-07T13:23:47.461891Z","title":"Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity","venue":"cs.DS","work_id":"e116433f-4f17-4234-b614-098056b333fd","year":2024},"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":7,"source":"pdf_text","source_observed_at":"2026-07-07T13:18:26.809614Z"},"links":{"cited_paper":"/paper/2411.08773","citing_paper":"/paper/2607.05384"},"observation_digest":"sha256:6021ede9b912db55a5290006a575f2259fdb84bdb7a81df27b73b154d669cded","observation_id":"fb3e3e4c-2b65-44c6-bd30-9aee2a1c47bb","resolution":{"observed_at":"2026-07-07T13:23:47.463173Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.08773","last_updated":"2025-04-28T20:23:39Z","snapshot_observed_at":"2026-07-06T19:49:52.926290Z","submitted_at":"2024-11-13T16:58:51Z","title":"Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.08773","snapshot_observed_at":"2026-07-11T07:08:16.892784Z","title":null,"venue":null,"work_id":null,"year":2024},"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":7,"source":"pdf_text","source_observed_at":"2026-07-11T07:08:16.892784Z"},"links":{"cited_paper":"/paper/2411.08773","citing_paper":"/paper/2607.05384"},"observation_digest":"sha256:725a29fa5e36cd5e48c2f19a276ce11d3937b11a9fefd8ccebe8a7be70ac3ec3","observation_id":"5354a3a4-0218-48ed-8ca7-e10a655764f4","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/2411.08773/citation-record","integrity":"/paper/2411.08773/integrity","json":"/paper/2411.08773/citation-record.json","paper":"/paper/2411.08773"},"outbound":[],"paper":{"arxiv_id":"2411.08773","last_updated":"2025-04-28T20:23:39Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T19:49:52.926290Z","submitted_at":"2024-11-13T16:58:51Z","title":"Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2411.08773."}