{"as_of":"2026-08-06T04:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4e4648d73954664c7b5b34da531367d293f7fcb59911fbfcd7bfb11ac9643d1e","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":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T09:24:13.455779Z","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-09T21:36:34.301049Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1910.00762","last_updated":"2019-10-02T03:34:29Z","snapshot_observed_at":"2026-07-06T08:26:17.265696Z","submitted_at":"2019-10-02T03:34:29Z","title":"Accelerating Deep Learning by Focusing on the Biggest Losers","version":1},"cited_work":{"arxiv_id":"1910.00762","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.00762","snapshot_observed_at":"2026-07-09T21:36:34.301049Z","title":"Accelerating deep learning by focusing on the biggest losers","venue":"cs.LG","work_id":"d74905ea-58c3-4017-8f2d-878a41346b29","year":2019},"citing_paper":{"arxiv_id":"2502.10248","last_updated":"2025-02-24T10:12:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-14T15:58:10Z","title":"Step-Video-T2V Technical Report: The Practice, Challenges, and Future of Video Foundation Model","version":3},"reference_index":271,"source":"arxiv_source","source_observed_at":"2026-05-19T08:02:23.002090Z"},"links":{"cited_paper":"/paper/1910.00762","citing_paper":"/paper/2502.10248"},"observation_digest":"sha256:2e94d97ae99e88114fe9537bb8d586255e743c8dfb2db1cedf8ef2b39704e277","observation_id":"68a5714a-3a2a-4692-b3ba-bddf26efcd18","resolution":{"observed_at":"2026-05-19T08:02:23.824379Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.00762","last_updated":"2019-10-02T03:34:29Z","snapshot_observed_at":"2026-07-06T08:26:17.265696Z","submitted_at":"2019-10-02T03:34:29Z","title":"Accelerating Deep Learning by Focusing on the Biggest Losers","version":1},"cited_work":{"arxiv_id":"1910.00762","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.00762","snapshot_observed_at":"2026-07-09T21:36:34.301049Z","title":"Accelerating deep learning by focusing on the biggest losers","venue":"cs.LG","work_id":"d74905ea-58c3-4017-8f2d-878a41346b29","year":2019},"citing_paper":{"arxiv_id":"2502.12272","last_updated":"2026-04-30T11:57:30Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-17T19:16:37Z","title":"Learning to Reason at the Frontier of Learnability","version":6},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-23T02:41:21.571824Z"},"links":{"cited_paper":"/paper/1910.00762","citing_paper":"/paper/2502.12272"},"observation_digest":"sha256:d4c95028057ac8e494efb1ab364dd0e08bb8c097d1916f34d1b086cfff03ed15","observation_id":"658cc2a6-ce97-4eb2-93cf-fe04e7e4dc14","resolution":{"observed_at":"2026-05-23T02:42:26.150995Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.00762","last_updated":"2019-10-02T03:34:29Z","snapshot_observed_at":"2026-07-06T08:26:17.265696Z","submitted_at":"2019-10-02T03:34:29Z","title":"Accelerating Deep Learning by Focusing on the Biggest Losers","version":1},"cited_work":{"arxiv_id":"1910.00762","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.00762","snapshot_observed_at":"2026-07-09T21:36:34.301049Z","title":"Accelerating deep learning by focusing on the biggest losers","venue":"cs.LG","work_id":"d74905ea-58c3-4017-8f2d-878a41346b29","year":2019},"citing_paper":{"arxiv_id":"2605.07551","last_updated":"2026-05-08T10:27:51Z","snapshot_observed_at":"2026-08-05T14:33:48.431220Z","submitted_at":"2026-05-08T10:27:51Z","title":"Disagreement-Regularized Importance Sampling for Adversarial Label Corruption","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-11T02:07:55.783508Z"},"links":{"cited_paper":"/paper/1910.00762","citing_paper":"/paper/2605.07551"},"observation_digest":"sha256:4bdfbcb11d8f8f311c04d089260a8cc39042e1fdc0da6805aec59dbb1fc55112","observation_id":"f55bedfc-995d-4ca4-a5da-e2a153648eb4","resolution":{"observed_at":"2026-05-11T03:55:56.290650Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.00762","last_updated":"2019-10-02T03:34:29Z","snapshot_observed_at":"2026-07-06T08:26:17.265696Z","submitted_at":"2019-10-02T03:34:29Z","title":"Accelerating Deep Learning by Focusing on the Biggest Losers","version":1},"cited_work":{"arxiv_id":"1910.00762","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.00762","snapshot_observed_at":"2026-07-09T21:36:34.301049Z","title":"Accelerating deep learning by focusing on the biggest losers","venue":"cs.LG","work_id":"d74905ea-58c3-4017-8f2d-878a41346b29","year":2019},"citing_paper":{"arxiv_id":"2605.30537","last_updated":"2026-05-28T20:12:45Z","snapshot_observed_at":"2026-08-02T16:30:13.820994Z","submitted_at":"2026-05-28T20:12:45Z","title":"The Long-Term Effects of Data Selection in LLM Fine-Tuning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T08:59:21.587474Z"},"links":{"cited_paper":"/paper/1910.00762","citing_paper":"/paper/2605.30537"},"observation_digest":"sha256:4b7ec6a3f626b64952989796cc5c4e34e95a9bf6fd5587b0605ca93c27078a02","observation_id":"028b931e-1aa0-44f1-b926-49f75764240f","resolution":{"observed_at":"2026-06-29T09:03:15.777982Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.00762","last_updated":"2019-10-02T03:34:29Z","snapshot_observed_at":"2026-07-06T08:26:17.265696Z","submitted_at":"2019-10-02T03:34:29Z","title":"Accelerating Deep Learning by Focusing on the Biggest Losers","version":1},"cited_work":{"arxiv_id":"1910.00762","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.00762","snapshot_observed_at":"2026-07-09T21:36:34.301049Z","title":"Accelerating deep learning by focusing on the biggest losers","venue":"cs.LG","work_id":"d74905ea-58c3-4017-8f2d-878a41346b29","year":2019},"citing_paper":{"arxiv_id":"2606.02453","last_updated":"2026-06-01T16:25:10Z","snapshot_observed_at":"2026-08-02T22:48:07.065976Z","submitted_at":"2026-06-01T16:25:10Z","title":"Initialization is Half the Battle: Generating Diverse Images from a Guidance Potential Posterior","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-06-28T15:19:32.238094Z"},"links":{"cited_paper":"/paper/1910.00762","citing_paper":"/paper/2606.02453"},"observation_digest":"sha256:fafc119681c695200e8b5e63a192173c86a5efe6ce02a72c0f75d26f1c47f193","observation_id":"b254516f-de78-4596-9f2f-96ed2cee9c53","resolution":{"observed_at":"2026-07-01T22:36:16.677863Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.00762","last_updated":"2019-10-02T03:34:29Z","snapshot_observed_at":"2026-07-06T08:26:17.265696Z","submitted_at":"2019-10-02T03:34:29Z","title":"Accelerating Deep Learning by Focusing on the Biggest Losers","version":1},"cited_work":{"arxiv_id":"1910.00762","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.00762","snapshot_observed_at":"2026-07-09T21:36:34.301049Z","title":"Accelerating deep learning by focusing on the biggest losers","venue":"cs.LG","work_id":"d74905ea-58c3-4017-8f2d-878a41346b29","year":2019},"citing_paper":{"arxiv_id":"2606.02565","last_updated":"2026-06-01T17:55:05Z","snapshot_observed_at":"2026-07-06T23:42:58.036516Z","submitted_at":"2026-06-01T17:55:05Z","title":"Policy-based Foveated Imaging and Perception","version":1},"reference_index":113,"source":"arxiv_source","source_observed_at":"2026-06-28T15:23:48.688620Z"},"links":{"cited_paper":"/paper/1910.00762","citing_paper":"/paper/2606.02565"},"observation_digest":"sha256:654116ff993186adc3565dec72a938fcf0874d972ef776eac31d15bf69e823cc","observation_id":"0e37cd66-ff1a-46e5-944e-f304143f2208","resolution":{"observed_at":"2026-07-01T22:26:17.709541Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.00762","last_updated":"2019-10-02T03:34:29Z","snapshot_observed_at":"2026-07-06T08:26:17.265696Z","submitted_at":"2019-10-02T03:34:29Z","title":"Accelerating Deep Learning by Focusing on the Biggest Losers","version":1},"cited_work":{"arxiv_id":"1910.00762","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.00762","snapshot_observed_at":"2026-07-09T21:36:34.301049Z","title":"Accelerating deep learning by focusing on the biggest losers","venue":"cs.LG","work_id":"d74905ea-58c3-4017-8f2d-878a41346b29","year":2019},"citing_paper":{"arxiv_id":"2606.11761","last_updated":"2026-06-10T07:37:01Z","snapshot_observed_at":"2026-07-06T23:50:49.040880Z","submitted_at":"2026-06-10T07:37:01Z","title":"RCAP: Robust, Class-Aware, Probabilistic Dynamic Dataset Pruning","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-06-27T10:13:13.967151Z"},"links":{"cited_paper":"/paper/1910.00762","citing_paper":"/paper/2606.11761"},"observation_digest":"sha256:fbfcc2438fab6e618d211e19dbbdb13bdb0c37b359ebba0501ec8f1cf77c010e","observation_id":"24a21a2f-edfb-4965-8cc6-753a2b516ac9","resolution":{"observed_at":"2026-07-03T10:17:57.254614Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.00762","last_updated":"2019-10-02T03:34:29Z","snapshot_observed_at":"2026-07-06T08:26:17.265696Z","submitted_at":"2019-10-02T03:34:29Z","title":"Accelerating Deep Learning by Focusing on the Biggest Losers","version":1},"cited_work":{"arxiv_id":"1910.00762","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.00762","snapshot_observed_at":"2026-07-09T21:36:34.301049Z","title":"Accelerating deep learning by focusing on the biggest losers","venue":"cs.LG","work_id":"d74905ea-58c3-4017-8f2d-878a41346b29","year":2019},"citing_paper":{"arxiv_id":"2606.12913","last_updated":"2026-07-03T08:36:16Z","snapshot_observed_at":"2026-08-03T14:56:08.217604Z","submitted_at":"2026-06-11T05:13:32Z","title":"Selecting Samples on Graphs: A Unified Dataset Pruning Framework for Lossless Training Acceleration","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T07:22:07.262151Z"},"links":{"cited_paper":"/paper/1910.00762","citing_paper":"/paper/2606.12913"},"observation_digest":"sha256:fb9c2e833ce7c1df6aa618f814043f9ac915cd138f8dfaa5802be7cc2fc8570b","observation_id":"426dd18d-ac07-4abd-ba49-2ceb066a3d65","resolution":{"observed_at":"2026-07-03T13:58:21.852363Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.00762","last_updated":"2019-10-02T03:34:29Z","snapshot_observed_at":"2026-07-06T08:26:17.265696Z","submitted_at":"2019-10-02T03:34:29Z","title":"Accelerating Deep Learning by Focusing on the Biggest Losers","version":1},"cited_work":{"arxiv_id":"1910.00762","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.00762","snapshot_observed_at":"2026-07-09T21:36:34.301049Z","title":"Accelerating deep learning by focusing on the biggest losers","venue":"cs.LG","work_id":"d74905ea-58c3-4017-8f2d-878a41346b29","year":2019},"citing_paper":{"arxiv_id":"2606.31796","last_updated":"2026-07-23T16:29:18Z","snapshot_observed_at":"2026-08-03T13:02:28.914044Z","submitted_at":"2026-06-30T15:14:38Z","title":"CHERRY: Compressed Hierarchical Experts with Recurrent Representational Yield","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-01T05:46:40.510955Z"},"links":{"cited_paper":"/paper/1910.00762","citing_paper":"/paper/2606.31796"},"observation_digest":"sha256:1d1705a9738387b6e9ae334afc11df50ef7daa66e21977423f9d09fc40e043ad","observation_id":"71c3e757-2a33-4aa1-8d8b-910b8529285d","resolution":{"observed_at":"2026-07-01T10:15:44.041091Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.00762","last_updated":"2019-10-02T03:34:29Z","snapshot_observed_at":"2026-07-06T08:26:17.265696Z","submitted_at":"2019-10-02T03:34:29Z","title":"Accelerating Deep Learning by Focusing on the Biggest Losers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.00762","snapshot_observed_at":"2026-08-02T09:24:13.455779Z","title":"H., Wong, D","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2606.31796","last_updated":"2026-07-23T16:29:18Z","snapshot_observed_at":"2026-08-03T13:02:28.914044Z","submitted_at":"2026-06-30T15:14:38Z","title":"CHERRY: Compressed Hierarchical Experts with Recurrent Representational Yield","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T09:24:13.455779Z"},"links":{"cited_paper":"/paper/1910.00762","citing_paper":"/paper/2606.31796"},"observation_digest":"sha256:971f2b86c3c1ee86c21b71a440993e44278c5ddec0307cc82b76ae9582a79b20","observation_id":"a84e778b-3129-44ba-956a-98ded106cd35","resolution":{"observed_at":"2026-08-02T09:24:13.455779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.00762","last_updated":"2019-10-02T03:34:29Z","snapshot_observed_at":"2026-07-06T08:26:17.265696Z","submitted_at":"2019-10-02T03:34:29Z","title":"Accelerating Deep Learning by Focusing on the Biggest Losers","version":1},"cited_work":{"arxiv_id":"1910.00762","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.00762","snapshot_observed_at":"2026-07-09T21:36:34.301049Z","title":"Accelerating deep learning by focusing on the biggest losers","venue":"cs.LG","work_id":"d74905ea-58c3-4017-8f2d-878a41346b29","year":2019},"citing_paper":{"arxiv_id":"2607.05903","last_updated":"2026-07-07T06:58:51Z","snapshot_observed_at":"2026-07-10T23:17:30.512702Z","submitted_at":"2026-07-07T06:58:51Z","title":"K-ABENA: K-Adaptive Backpropagation with Error-based N-exclusion Algorithm : (Compensated Loss-Based Sample Exclusion with Unbiased Gradient Estimation)","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-08T21:32:13.666284Z"},"links":{"cited_paper":"/paper/1910.00762","citing_paper":"/paper/2607.05903"},"observation_digest":"sha256:a6d36433dc8460e2f70c56eda579fd7fc981961a2abd8b0b9b7914fd99bb898e","observation_id":"6fa11cb3-c45e-4604-a5d0-26e6dcbe42e2","resolution":{"observed_at":"2026-07-08T21:35:37.692623Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.00762","last_updated":"2019-10-02T03:34:29Z","snapshot_observed_at":"2026-07-06T08:26:17.265696Z","submitted_at":"2019-10-02T03:34:29Z","title":"Accelerating Deep Learning by Focusing on the Biggest Losers","version":1},"cited_work":{"arxiv_id":"1910.00762","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.00762","snapshot_observed_at":"2026-07-09T21:36:34.301049Z","title":"Accelerating deep learning by focusing on the biggest losers","venue":"cs.LG","work_id":"d74905ea-58c3-4017-8f2d-878a41346b29","year":2019},"citing_paper":{"arxiv_id":"2607.07023","last_updated":"2026-07-08T05:44:33Z","snapshot_observed_at":"2026-08-04T11:00:17.176559Z","submitted_at":"2026-07-08T05:44:33Z","title":"Online Data Selection Is Implicit Alignment","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-07-09T21:35:41.947875Z"},"links":{"cited_paper":"/paper/1910.00762","citing_paper":"/paper/2607.07023"},"observation_digest":"sha256:70681f2b44488be6cde2e5d400a3ef9120cbfc24123bdc82708a0088f1f2cbb5","observation_id":"cf79d1f3-b2de-4387-8e7d-80d01529b784","resolution":{"observed_at":"2026-07-09T21:36:34.302303Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1910.00762/citation-record","integrity":"/paper/1910.00762/integrity","json":"/paper/1910.00762/citation-record.json","paper":"/paper/1910.00762"},"outbound":[],"paper":{"arxiv_id":"1910.00762","last_updated":"2019-10-02T03:34:29Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T08:26:17.265696Z","submitted_at":"2019-10-02T03:34:29Z","title":"Accelerating Deep Learning by Focusing on the Biggest Losers"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 12 inbound Pith citation observations for arXiv:1910.00762."}