{"as_of":"2026-08-10T00:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2af07aecc4c52638d34fad0e76765345837bde2c31281ce027c808dc070e9c1f","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-07T05:48:34.907499Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T17:50:00.991008Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2104.09937","last_updated":"2021-07-14T00:07:51Z","snapshot_observed_at":"2026-08-06T20:03:26.839485Z","submitted_at":"2021-04-20T12:55:37Z","title":"Gradient Matching for Domain Generalization","version":3},"cited_work":{"arxiv_id":"2104.09937","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.09937","snapshot_observed_at":"2026-07-04T17:50:00.991008Z","title":"Gradient matching for domain generalization","venue":null,"work_id":"eeae84d0-6efc-48ca-a671-1df842fa480c","year":2021},"citing_paper":{"arxiv_id":"2209.14742","last_updated":"2026-04-26T07:48:49Z","snapshot_observed_at":"2026-08-02T11:24:35.772004Z","submitted_at":"2022-09-29T13:01:14Z","title":"Learning Gradient-based Mixup with Extrapolation toward Flatter Minima for Domain Generalization","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-24T11:16:16.666438Z"},"links":{"cited_paper":"/paper/2104.09937","citing_paper":"/paper/2209.14742"},"observation_digest":"sha256:208d3d0a2c93ae0ea8cb1f0ee8601d1641d0f1d3bc82c7c05a5060ccd1a59ca5","observation_id":"4cb34348-7a31-44b4-9334-a4c4f60e93f4","resolution":{"observed_at":"2026-05-24T11:19:23.205767Z","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":"2104.09937","last_updated":"2021-07-14T00:07:51Z","snapshot_observed_at":"2026-08-06T20:03:26.839485Z","submitted_at":"2021-04-20T12:55:37Z","title":"Gradient Matching for Domain Generalization","version":3},"cited_work":{"arxiv_id":"2104.09937","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.09937","snapshot_observed_at":"2026-07-04T17:50:00.991008Z","title":"Gradient matching for domain generalization","venue":null,"work_id":"eeae84d0-6efc-48ca-a671-1df842fa480c","year":2021},"citing_paper":{"arxiv_id":"2410.14375","last_updated":"2026-05-12T21:39:41Z","snapshot_observed_at":"2026-07-06T19:35:52.925493Z","submitted_at":"2024-10-18T11:06:23Z","title":"Causal Fine-Tuning under Latent Confounded Shift","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-23T18:58:26.552293Z"},"links":{"cited_paper":"/paper/2104.09937","citing_paper":"/paper/2410.14375"},"observation_digest":"sha256:21d11f2dea55a94334dc680cbfe3c4199c4f2c8591eadc53fd590ac9c70e4cb4","observation_id":"d58ea9b1-aa2f-48f4-9a61-18dca864084f","resolution":{"observed_at":"2026-05-23T19:03:22.202567Z","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":"2104.09937","last_updated":"2021-07-14T00:07:51Z","snapshot_observed_at":"2026-08-06T20:03:26.839485Z","submitted_at":"2021-04-20T12:55:37Z","title":"Gradient Matching for Domain Generalization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.09937","snapshot_observed_at":"2026-08-07T05:48:34.907499Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.07378","last_updated":"2025-06-09T02:51:36Z","snapshot_observed_at":"2026-08-09T17:58:30.461236Z","submitted_at":"2025-06-09T02:51:36Z","title":"Moment Alignment: Unifying Gradient and Hessian Matching for Domain Generalization","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T05:48:34.907499Z"},"links":{"cited_paper":"/paper/2104.09937","citing_paper":"/paper/2506.07378"},"observation_digest":"sha256:70699425eccb1c58340e22114fda9a82574b727fb204c7974e1aaa304896d029","observation_id":"cd2412f8-53eb-4632-8071-b3bd7d6a7c3b","resolution":{"observed_at":"2026-08-07T05:48:34.907499Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.09937","last_updated":"2021-07-14T00:07:51Z","snapshot_observed_at":"2026-08-06T20:03:26.839485Z","submitted_at":"2021-04-20T12:55:37Z","title":"Gradient Matching for Domain Generalization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.09937","snapshot_observed_at":"2026-08-06T19:56:09.328287Z","title":"Gradi- ent matching for domain generalization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.04302","last_updated":"2025-07-06T09:03:08Z","snapshot_observed_at":"2026-08-06T19:48:27.628510Z","submitted_at":"2025-07-06T09:03:08Z","title":"Adversarial Data Augmentation for Single Domain Generalization via Lyapunov Exponent-Guided Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T19:56:09.328287Z"},"links":{"cited_paper":"/paper/2104.09937","citing_paper":"/paper/2507.04302"},"observation_digest":"sha256:26c55529774698a267be3ffbaf3fb27cae01981d4c84849109f1c48160fa95a3","observation_id":"b111f3a3-98ba-4933-86fd-a53da4b13a30","resolution":{"observed_at":"2026-08-06T19:56:09.328287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.09937","last_updated":"2021-07-14T00:07:51Z","snapshot_observed_at":"2026-08-06T20:03:26.839485Z","submitted_at":"2021-04-20T12:55:37Z","title":"Gradient Matching for Domain Generalization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.09937","snapshot_observed_at":"2026-08-05T21:10:30.019442Z","title":"arXiv preprint arXiv:2104.09937 (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.09418","last_updated":"2025-08-13T01:30:11Z","snapshot_observed_at":"2026-08-09T04:48:02.738309Z","submitted_at":"2025-08-13T01:30:11Z","title":"Domain-Generalization to Improve Learning in Meta-Learning Algorithms","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T21:10:30.019442Z"},"links":{"cited_paper":"/paper/2104.09937","citing_paper":"/paper/2508.09418"},"observation_digest":"sha256:2f81093b80e8343d00976c31f260216f333ee084d34ad43f3972b067ca3d3022","observation_id":"6ffce50a-5a2a-4f92-b762-9a4b74cba3a7","resolution":{"observed_at":"2026-08-05T21:10:30.019442Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.09937","last_updated":"2021-07-14T00:07:51Z","snapshot_observed_at":"2026-08-06T20:03:26.839485Z","submitted_at":"2021-04-20T12:55:37Z","title":"Gradient Matching for Domain Generalization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.09937","snapshot_observed_at":"2026-08-05T11:24:05.625466Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.02918","last_updated":"2025-09-03T01:07:49Z","snapshot_observed_at":"2026-08-09T17:28:20.992208Z","submitted_at":"2025-09-03T01:07:49Z","title":"Single Domain Generalization in Diabetic Retinopathy: A Neuro-Symbolic Learning Approach","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T11:24:05.625466Z"},"links":{"cited_paper":"/paper/2104.09937","citing_paper":"/paper/2509.02918"},"observation_digest":"sha256:b15e412b80faccb7747093af47e42366a37ece0a70d481e135256ec741cf8c21","observation_id":"5a19a987-d1a0-4cbc-9985-fe8390557422","resolution":{"observed_at":"2026-08-05T11:24:05.625466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.09937","last_updated":"2021-07-14T00:07:51Z","snapshot_observed_at":"2026-08-06T20:03:26.839485Z","submitted_at":"2021-04-20T12:55:37Z","title":"Gradient Matching for Domain Generalization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.09937","snapshot_observed_at":"2026-08-04T11:40:24.903683Z","title":"Gradient matching for domain generalization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.03839","last_updated":"2026-05-29T10:04:43Z","snapshot_observed_at":"2026-08-08T04:18:18.589612Z","submitted_at":"2025-10-04T15:31:26Z","title":"Technical note on Sequential Test-Time Adaptation via Martingale-Driven Fisher Prompting","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T11:40:24.903683Z"},"links":{"cited_paper":"/paper/2104.09937","citing_paper":"/paper/2510.03839"},"observation_digest":"sha256:7ca3ec95b47bd5b353fe9cf09e106361e36321071a01da1b2eae42c6dbe61700","observation_id":"c91ceac7-50db-46e7-8c59-d0f7b1d61217","resolution":{"observed_at":"2026-08-04T11:40:24.903683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.09937","last_updated":"2021-07-14T00:07:51Z","snapshot_observed_at":"2026-08-06T20:03:26.839485Z","submitted_at":"2021-04-20T12:55:37Z","title":"Gradient Matching for Domain Generalization","version":3},"cited_work":{"arxiv_id":"2104.09937","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.09937","snapshot_observed_at":"2026-07-04T17:50:00.991008Z","title":"Gradient matching for domain generalization","venue":null,"work_id":"eeae84d0-6efc-48ca-a671-1df842fa480c","year":2021},"citing_paper":{"arxiv_id":"2605.14654","last_updated":"2026-05-14T10:10:34Z","snapshot_observed_at":"2026-08-02T09:41:15.728024Z","submitted_at":"2026-05-14T10:10:34Z","title":"Beyond Instance-Level Self-Supervision in 3D Multi-Modal Medical Imaging","version":1},"reference_index":174,"source":"arxiv_source","source_observed_at":"2026-05-15T05:27:50.881496Z"},"links":{"cited_paper":"/paper/2104.09937","citing_paper":"/paper/2605.14654"},"observation_digest":"sha256:d75687a220314c8caffe59cde1b950ed570a5702dc94daefffbee2dc9fca3c64","observation_id":"54c3bdb2-9c69-4f83-9343-2eecf0a491d7","resolution":{"observed_at":"2026-05-15T05:29:47.310076Z","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":"2104.09937","last_updated":"2021-07-14T00:07:51Z","snapshot_observed_at":"2026-08-06T20:03:26.839485Z","submitted_at":"2021-04-20T12:55:37Z","title":"Gradient Matching for Domain Generalization","version":3},"cited_work":{"arxiv_id":"2104.09937","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.09937","snapshot_observed_at":"2026-07-04T17:50:00.991008Z","title":"Gradient matching for domain generalization","venue":null,"work_id":"eeae84d0-6efc-48ca-a671-1df842fa480c","year":2021},"citing_paper":{"arxiv_id":"2605.15775","last_updated":"2026-05-15T09:31:10Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T09:31:10Z","title":"Continual Learning of Domain-Invariant Representations","version":1},"reference_index":117,"source":"arxiv_source","source_observed_at":"2026-05-20T21:16:08.255679Z"},"links":{"cited_paper":"/paper/2104.09937","citing_paper":"/paper/2605.15775"},"observation_digest":"sha256:7632bc56fe135fbdf5f542d2f47f17cb8e2c27e8a928324770eae1461d6a9369","observation_id":"59ba1221-f6f6-4b52-93c7-209c684f7918","resolution":{"observed_at":"2026-05-20T21:19:03.205171Z","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":"2104.09937","last_updated":"2021-07-14T00:07:51Z","snapshot_observed_at":"2026-08-06T20:03:26.839485Z","submitted_at":"2021-04-20T12:55:37Z","title":"Gradient Matching for Domain Generalization","version":3},"cited_work":{"arxiv_id":"2104.09937","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.09937","snapshot_observed_at":"2026-07-04T17:50:00.991008Z","title":"Gradient matching for domain generalization","venue":null,"work_id":"eeae84d0-6efc-48ca-a671-1df842fa480c","year":2021},"citing_paper":{"arxiv_id":"2606.05025","last_updated":"2026-06-03T15:48:52Z","snapshot_observed_at":"2026-08-06T23:48:49.542117Z","submitted_at":"2026-06-03T15:48:52Z","title":"Invariant Gradient Alignment for Robust Reasoning Distillation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T06:56:05.310135Z"},"links":{"cited_paper":"/paper/2104.09937","citing_paper":"/paper/2606.05025"},"observation_digest":"sha256:978ce12251d1c183e77d8a5b06637bfc74485357b14ee5db0438788bb47f8cfe","observation_id":"298ee6cd-d326-4f65-9517-475f8cce586d","resolution":{"observed_at":"2026-07-02T07:26:46.030561Z","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":"2104.09937","last_updated":"2021-07-14T00:07:51Z","snapshot_observed_at":"2026-08-06T20:03:26.839485Z","submitted_at":"2021-04-20T12:55:37Z","title":"Gradient Matching for Domain Generalization","version":3},"cited_work":{"arxiv_id":"2104.09937","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.09937","snapshot_observed_at":"2026-07-04T17:50:00.991008Z","title":"Gradient matching for domain generalization","venue":null,"work_id":"eeae84d0-6efc-48ca-a671-1df842fa480c","year":2021},"citing_paper":{"arxiv_id":"2606.05365","last_updated":"2026-06-03T19:12:46Z","snapshot_observed_at":"2026-07-06T23:45:23.749718Z","submitted_at":"2026-06-03T19:12:46Z","title":"Environment-Robust Representation Learning with Empirical Bayes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T03:51:43.739636Z"},"links":{"cited_paper":"/paper/2104.09937","citing_paper":"/paper/2606.05365"},"observation_digest":"sha256:e5bb99a906baf1b93c00f8014ee51b9ecec77e50e181e2c428cd79d69c562e2a","observation_id":"a3be34b4-aec6-4ad5-be27-71b96af183e6","resolution":{"observed_at":"2026-07-02T11:26:54.489212Z","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":"2104.09937","last_updated":"2021-07-14T00:07:51Z","snapshot_observed_at":"2026-08-06T20:03:26.839485Z","submitted_at":"2021-04-20T12:55:37Z","title":"Gradient Matching for Domain Generalization","version":3},"cited_work":{"arxiv_id":"2104.09937","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.09937","snapshot_observed_at":"2026-07-04T17:50:00.991008Z","title":"Gradient matching for domain generalization","venue":null,"work_id":"eeae84d0-6efc-48ca-a671-1df842fa480c","year":2021},"citing_paper":{"arxiv_id":"2606.05846","last_updated":"2026-06-18T14:29:45Z","snapshot_observed_at":"2026-08-01T19:18:02.371973Z","submitted_at":"2026-06-04T08:22:55Z","title":"Towards Truly Multilingual ASR: Generalizing Code-Switching ASR to Unseen Language Pairs","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-06-28T01:51:26.833958Z"},"links":{"cited_paper":"/paper/2104.09937","citing_paper":"/paper/2606.05846"},"observation_digest":"sha256:a947cde6aebc008505801365f37bd7f2f03554a235f0e35b48379759452f0673","observation_id":"baa43898-2cc0-42e1-94ed-d81d75c4c0a3","resolution":{"observed_at":"2026-07-02T12:46:56.914098Z","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":"2104.09937","last_updated":"2021-07-14T00:07:51Z","snapshot_observed_at":"2026-08-06T20:03:26.839485Z","submitted_at":"2021-04-20T12:55:37Z","title":"Gradient Matching for Domain Generalization","version":3},"cited_work":{"arxiv_id":"2104.09937","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.09937","snapshot_observed_at":"2026-07-04T17:50:00.991008Z","title":"Gradient matching for domain generalization","venue":null,"work_id":"eeae84d0-6efc-48ca-a671-1df842fa480c","year":2021},"citing_paper":{"arxiv_id":"2606.24781","last_updated":"2026-06-23T16:40:05Z","snapshot_observed_at":"2026-08-05T19:16:44.360222Z","submitted_at":"2026-06-23T16:40:05Z","title":"Assessing Distribution Shift in Human Activity Recognition for Domain Generalization","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-25T23:20:55.700250Z"},"links":{"cited_paper":"/paper/2104.09937","citing_paper":"/paper/2606.24781"},"observation_digest":"sha256:21338ebaf5323d4988f7200993b3487df93742ca00815431fd0b2d0a1ad38d6c","observation_id":"271e2ce5-b143-45cf-929c-558c485be5fb","resolution":{"observed_at":"2026-07-04T17:50:00.992703Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2104.09937/citation-record","integrity":"/paper/2104.09937/integrity","json":"/paper/2104.09937/citation-record.json","paper":"/paper/2104.09937"},"outbound":[],"paper":{"arxiv_id":"2104.09937","last_updated":"2021-07-14T00:07:51Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T20:03:26.839485Z","submitted_at":"2021-04-20T12:55:37Z","title":"Gradient Matching for Domain Generalization"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 13 inbound Pith citation observations for arXiv:2104.09937."}