{"as_of":"2026-08-09T20:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:88a1eb8cb9b62de5a8436e83cd2b6156683d0a5ca4772c89e2d4e541d372a6be","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":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:03:39.440788Z","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-10T21:57:37.053200Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2009.11392","last_updated":"2020-09-23T21:40:36Z","snapshot_observed_at":"2026-08-02T17:18:52.409029Z","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":"2009.11392","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.11392","snapshot_observed_at":"2026-07-10T21:57:37.053200Z","title":"Nakatsukasa , Fast and stable randomized low-rank matrix approximation , arXiv:2009.11392 [math.NA], (2020)","venue":"math.NA","work_id":"235783de-829b-4d0e-b18d-5a0048c07467","year":2020},"citing_paper":{"arxiv_id":"2411.01986","last_updated":"2026-04-21T13:54:58Z","snapshot_observed_at":"2026-08-08T13:32:43.399702Z","submitted_at":"2024-11-04T11:18:14Z","title":"Randomized coupled decompositions","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-23T17:50:17.168011Z"},"links":{"cited_paper":"/paper/2009.11392","citing_paper":"/paper/2411.01986"},"observation_digest":"sha256:08898af67c2d702d0767e2bb4b6383969b843169387d336739b186722d877d49","observation_id":"ee713aa0-4d94-4250-8a1e-f0ecc9c1b3a5","resolution":{"observed_at":"2026-05-23T17:53:18.649610Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11392","last_updated":"2020-09-23T21:40:36Z","snapshot_observed_at":"2026-08-02T17:18:52.409029Z","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.11392","snapshot_observed_at":"2026-08-07T15:03:39.440788Z","title":"Nakatsukasa, Fast and stable randomized low-rank matrix approximation , arXiv preprint arXiv:2009.11392, (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.16937","last_updated":"2025-09-06T14:27:10Z","snapshot_observed_at":"2026-08-09T15:33:14.695954Z","submitted_at":"2025-05-22T17:27:40Z","title":"Quasi-optimal hierarchically semi-separable matrix approximation","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:39.440788Z"},"links":{"cited_paper":"/paper/2009.11392","citing_paper":"/paper/2505.16937"},"observation_digest":"sha256:83d14b4eaac9672c9b91f3dbcf37dfe84567adf8a80b94f57be2d2750473d04f","observation_id":"5d024537-1197-47c9-b774-639cfacb8b75","resolution":{"observed_at":"2026-08-07T15:03:39.440788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11392","last_updated":"2020-09-23T21:40:36Z","snapshot_observed_at":"2026-08-02T17:18:52.409029Z","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.11392","snapshot_observed_at":"2026-08-07T13:58:30.767236Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.20528","last_updated":"2025-05-26T21:12:23Z","snapshot_observed_at":"2026-08-08T18:38:02.312370Z","submitted_at":"2025-05-26T21:12:23Z","title":"Superfast 1-Norm Estimation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:58:30.767236Z"},"links":{"cited_paper":"/paper/2009.11392","citing_paper":"/paper/2505.20528"},"observation_digest":"sha256:d2b0bf92f93014687fc5e5e337d41381c9a23e728c3273d16780d1f73672fa3e","observation_id":"743f5079-a827-4220-8330-5769e79e71e2","resolution":{"observed_at":"2026-08-07T13:58:30.767236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11392","last_updated":"2020-09-23T21:40:36Z","snapshot_observed_at":"2026-08-02T17:18:52.409029Z","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.11392","snapshot_observed_at":"2026-08-05T14:36:54.670579Z","title":"N AKATSUKASA , Fast and stable randomized low-rank matrix approximation, arXiv preprint arXiv:2009.11392v1, (2020), https://arxiv.org/abs/2009.11392v1","venue":null,"work_id":null,"year":2009},"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":87,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:54.670579Z"},"links":{"cited_paper":"/paper/2009.11392","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:f30b2856ab428cfd081d2408156f1bdcb2fc53e62ad47d8496c3c01773802b96","observation_id":"351eb127-3b72-4fde-9ef4-f3dba8dfa730","resolution":{"observed_at":"2026-08-05T14:36:54.670579Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11392","last_updated":"2020-09-23T21:40:36Z","snapshot_observed_at":"2026-08-02T17:18:52.409029Z","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.11392","snapshot_observed_at":"2026-07-14T23:11:18.736508Z","title":"Fast and stable randomized low-rank matrix approximation.arXiv preprint arXiv:2009.11392, 2020","venue":null,"work_id":null,"year":2009},"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":33,"source":"pdf_text","source_observed_at":"2026-07-14T23:11:18.736508Z"},"links":{"cited_paper":"/paper/2009.11392","citing_paper":"/paper/2603.11009"},"observation_digest":"sha256:542066f000bcf82c39cbd90db7b58977d47a9f88b181c05f93853503e0e68aa0","observation_id":"4bc2feed-3d93-4e35-9a6d-e2fa705a819d","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":"2009.11392","last_updated":"2020-09-23T21:40:36Z","snapshot_observed_at":"2026-08-02T17:18:52.409029Z","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":"2009.11392","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.11392","snapshot_observed_at":"2026-07-10T21:57:37.053200Z","title":"Nakatsukasa , Fast and stable randomized low-rank matrix approximation , arXiv:2009.11392 [math.NA], (2020)","venue":"math.NA","work_id":"235783de-829b-4d0e-b18d-5a0048c07467","year":2020},"citing_paper":{"arxiv_id":"2604.05065","last_updated":"2026-04-06T18:11:36Z","snapshot_observed_at":"2026-08-03T00:56:48.492790Z","submitted_at":"2026-04-06T18:11:36Z","title":"Adaptive LSQR Preconditioning from One Small Sketch","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-10T18:58:41.033748Z"},"links":{"cited_paper":"/paper/2009.11392","citing_paper":"/paper/2604.05065"},"observation_digest":"sha256:41da4c96bf5a9ca330bd8212cb1239fa41ab06c14c831d781aede2184f8a08cd","observation_id":"a9865fc7-7550-4aa6-b871-8fb3b5eda78f","resolution":{"observed_at":"2026-05-10T23:35:52.552628Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11392","last_updated":"2020-09-23T21:40:36Z","snapshot_observed_at":"2026-08-02T17:18:52.409029Z","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":"2009.11392","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.11392","snapshot_observed_at":"2026-07-10T21:57:37.053200Z","title":"Nakatsukasa , Fast and stable randomized low-rank matrix approximation , arXiv:2009.11392 [math.NA], (2020)","venue":"math.NA","work_id":"235783de-829b-4d0e-b18d-5a0048c07467","year":2020},"citing_paper":{"arxiv_id":"2605.09755","last_updated":"2026-05-10T21:05:03Z","snapshot_observed_at":"2026-08-01T00:27:04.681079Z","submitted_at":"2026-05-10T21:05:03Z","title":"Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-12T03:10:47.684786Z"},"links":{"cited_paper":"/paper/2009.11392","citing_paper":"/paper/2605.09755"},"observation_digest":"sha256:f04bf7f5b6fd3fe7ff8a54b2b0c6dc2144d1559293e39a3a4974cb47833b8555","observation_id":"64ca3870-608a-413d-aaee-2c7604a6060c","resolution":{"observed_at":"2026-05-12T03:11:18.754985Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11392","last_updated":"2020-09-23T21:40:36Z","snapshot_observed_at":"2026-08-02T17:18:52.409029Z","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":"2009.11392","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.11392","snapshot_observed_at":"2026-07-10T21:57:37.053200Z","title":"Nakatsukasa , Fast and stable randomized low-rank matrix approximation , arXiv:2009.11392 [math.NA], (2020)","venue":"math.NA","work_id":"235783de-829b-4d0e-b18d-5a0048c07467","year":2020},"citing_paper":{"arxiv_id":"2605.19096","last_updated":"2026-07-31T18:49:53Z","snapshot_observed_at":"2026-08-06T23:11:18.178147Z","submitted_at":"2026-05-18T20:32:28Z","title":"Sharp analysis of sketched least squares and randomized low-rank approximation","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-20T07:25:22.937413Z"},"links":{"cited_paper":"/paper/2009.11392","citing_paper":"/paper/2605.19096"},"observation_digest":"sha256:b2996be3082d8e4af0d1a57a9a0c337ab2a69518269649e46099b26961f618e4","observation_id":"17a7611f-b7c6-4704-916a-549aa46bfc7a","resolution":{"observed_at":"2026-05-20T07:28:06.759097Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11392","last_updated":"2020-09-23T21:40:36Z","snapshot_observed_at":"2026-08-02T17:18:52.409029Z","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":"2009.11392","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.11392","snapshot_observed_at":"2026-07-10T21:57:37.053200Z","title":"Nakatsukasa , Fast and stable randomized low-rank matrix approximation , arXiv:2009.11392 [math.NA], (2020)","venue":"math.NA","work_id":"235783de-829b-4d0e-b18d-5a0048c07467","year":2020},"citing_paper":{"arxiv_id":"2606.01335","last_updated":"2026-05-31T16:38:43Z","snapshot_observed_at":"2026-08-06T18:04:32.517217Z","submitted_at":"2026-05-31T16:38:43Z","title":"Transpose-free linear algebra","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-28T16:22:10.159728Z"},"links":{"cited_paper":"/paper/2009.11392","citing_paper":"/paper/2606.01335"},"observation_digest":"sha256:3a6d9c9c1ada38059d08753d9e90355c62d806d05d24bd2d93f7b89688169634","observation_id":"6cf89ac2-b6a7-484c-803f-e589960d2546","resolution":{"observed_at":"2026-07-01T21:46:15.462887Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11392","last_updated":"2020-09-23T21:40:36Z","snapshot_observed_at":"2026-08-02T17:18:52.409029Z","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":"2009.11392","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.11392","snapshot_observed_at":"2026-07-10T21:57:37.053200Z","title":"Nakatsukasa , Fast and stable randomized low-rank matrix approximation , arXiv:2009.11392 [math.NA], (2020)","venue":"math.NA","work_id":"235783de-829b-4d0e-b18d-5a0048c07467","year":2020},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"cited_paper":"/paper/2009.11392","citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:c815a2933b821a17f650e256e427a8398ee9e3e2242f25eed00029d6c478a8f0","observation_id":"8de78da6-13d4-474e-ae7c-4ed4b32c29f0","resolution":{"observed_at":"2026-07-10T21:57:37.079677Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11392","last_updated":"2020-09-23T21:40:36Z","snapshot_observed_at":"2026-08-02T17:18:52.409029Z","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.11392","snapshot_observed_at":"2026-08-02T00:01:59.011672Z","title":"Nakatsukasa, (2020), arXiv:2009.11392","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.15158","last_updated":"2026-07-16T16:00:54Z","snapshot_observed_at":"2026-08-08T14:10:40.138347Z","submitted_at":"2026-07-16T16:00:54Z","title":"Fast two-dimensional tensor-network contraction via subspace iteration","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-02T00:01:59.011672Z"},"links":{"cited_paper":"/paper/2009.11392","citing_paper":"/paper/2607.15158"},"observation_digest":"sha256:9fad2fa50820b3ca04480c6e63ceb3028a1b4d83e666f9279794755ea8f28aeb","observation_id":"d71ef4af-01fb-4907-afba-87622e20f9b7","resolution":{"observed_at":"2026-08-02T00:01:59.011672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11392","last_updated":"2020-09-23T21:40:36Z","snapshot_observed_at":"2026-08-02T17:18:52.409029Z","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.11392","snapshot_observed_at":"2026-08-03T08:39:55.739442Z","title":"arXiv preprint arXiv:2009.11392 , year=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:55.739442Z"},"links":{"cited_paper":"/paper/2009.11392","citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:0beccdb4adc8bf837c35c2c6001068a609834a9b444f35845dba032435cdae8a","observation_id":"90f34e5e-d0d7-4f45-aef2-988ce68f53d8","resolution":{"observed_at":"2026-08-03T08:39:55.739442Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11392","last_updated":"2020-09-23T21:40:36Z","snapshot_observed_at":"2026-08-02T17:18:52.409029Z","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.11392","snapshot_observed_at":"2026-08-05T00:25:45.446529Z","title":"arXiv preprint arXiv:2009.11392 , year=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2608.00840","last_updated":"2026-08-01T19:43:41Z","snapshot_observed_at":"2026-08-06T23:24:54.021759Z","submitted_at":"2026-08-01T19:43:41Z","title":"Sublinear Time Eigenvector Approximation via Column Sampling","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-05T00:25:45.446529Z"},"links":{"cited_paper":"/paper/2009.11392","citing_paper":"/paper/2608.00840"},"observation_digest":"sha256:d933a8cc60d6f939e1ea68dda8a982979e08a34d644402af98ede30583e3ecf2","observation_id":"5f5b2c94-e820-43f5-a8a6-433dd80fb7cd","resolution":{"observed_at":"2026-08-05T00:25:45.446529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2009.11392/citation-record","integrity":"/paper/2009.11392/integrity","json":"/paper/2009.11392/citation-record.json","paper":"/paper/2009.11392"},"outbound":[],"paper":{"arxiv_id":"2009.11392","last_updated":"2020-09-23T21:40:36Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-08-02T17:18:52.409029Z","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation"},"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 13 inbound Pith citation observations for arXiv:2009.11392."}