{"as_of":"2026-08-10T17:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:89d393f6f1b8cc2b16aa102ac19b93f0c1a9037e24fc14d2c72af8cba366f786","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:44:46.170635Z","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-10T06:06:50.408901Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1004.4389","last_updated":"2011-06-15T23:03:32Z","snapshot_observed_at":"2026-08-03T12:18:37.237031Z","submitted_at":"2010-04-25T23:21:23Z","title":"User-friendly tail bounds for sums of random matrices","version":7},"cited_work":{"arxiv_id":"1004.4389","doi":null,"metadata_source":"pith","pith_arxiv_id":"1004.4389","snapshot_observed_at":"2026-07-10T06:06:50.408901Z","title":"User-friendly tail bounds for sums of random matrices","venue":"math.PR","work_id":"5ed7cfb7-2d47-4240-a309-03a33eb00c8a","year":2010},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1004.4389","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:48fafebb55055ca24bc6c28b4a8309ceceacac04c6d1f7b00c088774cd657e1b","observation_id":"aaa93f0b-91aa-4e2a-8453-002a8b9727fd","resolution":{"observed_at":"2026-05-25T16:41:02.499372Z","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":"1004.4389","last_updated":"2011-06-15T23:03:32Z","snapshot_observed_at":"2026-08-03T12:18:37.237031Z","submitted_at":"2010-04-25T23:21:23Z","title":"User-friendly tail bounds for sums of random matrices","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1004.4389","snapshot_observed_at":"2026-08-06T16:44:46.170635Z","title":"[Tuk74] John W Tukey","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.13778","last_updated":"2025-07-18T09:36:32Z","snapshot_observed_at":"2026-08-09T23:12:34.858914Z","submitted_at":"2025-07-18T09:36:32Z","title":"Error exponents for tripartite-to-bipartite entanglement transformations","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-06T16:44:46.170635Z"},"links":{"cited_paper":"/paper/1004.4389","citing_paper":"/paper/2507.13778"},"observation_digest":"sha256:2dbe0e8d35e6435e6d949a80fea547394bd7a7dd0eed8d71331e4d0ac6091a13","observation_id":"4354c7b1-5df4-465c-9d36-993edf38ee6b","resolution":{"observed_at":"2026-08-06T16:44:46.170635Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1004.4389","last_updated":"2011-06-15T23:03:32Z","snapshot_observed_at":"2026-08-03T12:18:37.237031Z","submitted_at":"2010-04-25T23:21:23Z","title":"User-friendly tail bounds for sums of random matrices","version":7},"cited_work":{"arxiv_id":"1004.4389","doi":null,"metadata_source":"pith","pith_arxiv_id":"1004.4389","snapshot_observed_at":"2026-07-10T06:06:50.408901Z","title":"User-friendly tail bounds for sums of random matrices","venue":"math.PR","work_id":"5ed7cfb7-2d47-4240-a309-03a33eb00c8a","year":2010},"citing_paper":{"arxiv_id":"2606.22639","last_updated":"2026-06-21T18:57:13Z","snapshot_observed_at":"2026-08-09T08:36:14.293435Z","submitted_at":"2026-06-21T18:57:13Z","title":"Statistical Inference for Misspecified Contextual Bandits","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-06-26T09:30:59.493793Z"},"links":{"cited_paper":"/paper/1004.4389","citing_paper":"/paper/2606.22639"},"observation_digest":"sha256:09bd4e9294dbff8d3a93cb049669a6751a1bec5f493e3f964caa96b1dd9961a6","observation_id":"c368638d-1ab1-4e95-95d3-8468af83d583","resolution":{"observed_at":"2026-07-04T09:49:44.307491Z","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":"1004.4389","last_updated":"2011-06-15T23:03:32Z","snapshot_observed_at":"2026-08-03T12:18:37.237031Z","submitted_at":"2010-04-25T23:21:23Z","title":"User-friendly tail bounds for sums of random matrices","version":7},"cited_work":{"arxiv_id":"1004.4389","doi":null,"metadata_source":"pith","pith_arxiv_id":"1004.4389","snapshot_observed_at":"2026-07-10T06:06:50.408901Z","title":"User-friendly tail bounds for sums of random matrices","venue":"math.PR","work_id":"5ed7cfb7-2d47-4240-a309-03a33eb00c8a","year":2010},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1004.4389","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:e6ba14c8bc81f63d8c296c9a7fac6d6d7a7a9d82eadf91029c7d967513adf3e9","observation_id":"ef425415-fc35-4a00-98c8-248e4bb4b906","resolution":{"observed_at":"2026-07-10T06:06:50.410277Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/1004.4389/citation-record","integrity":"/paper/1004.4389/integrity","json":"/paper/1004.4389/citation-record.json","paper":"/paper/1004.4389"},"outbound":[],"paper":{"arxiv_id":"1004.4389","last_updated":"2011-06-15T23:03:32Z","latest_version":7,"primary_category":"math.PR","snapshot_observed_at":"2026-08-03T12:18:37.237031Z","submitted_at":"2010-04-25T23:21:23Z","title":"User-friendly tail bounds for sums of random matrices"},"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 4 inbound Pith citation observations for arXiv:1004.4389."}