{"as_of":"2026-08-09T16:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3b82ac1f15c8e34bc448d3daa6f353f646d20ceed04eb8fb0e40ffb043d734ba","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-09T06:31:02.800959+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-06T12:03:43.102420Z","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-06-30T10:04:36.010420Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.16228","last_updated":"2024-07-11T23:03:09Z","snapshot_observed_at":"2026-08-07T21:43:05.647409Z","submitted_at":"2023-10-24T22:54:05Z","title":"On the Foundations of Shortcut Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.16228","snapshot_observed_at":"2026-08-06T12:03:43.102420Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.22216","last_updated":"2025-08-13T03:31:21Z","snapshot_observed_at":"2026-08-06T12:03:41.812283Z","submitted_at":"2025-07-29T20:25:09Z","title":"Representation biases: will we achieve complete understanding by analyzing representations?","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-06T12:03:43.102420Z"},"links":{"cited_paper":"/paper/2310.16228","citing_paper":"/paper/2507.22216"},"observation_digest":"sha256:115d5847f60c301f75af160627fbaf1c55ea031ab6ce7021d145b5208ae5e343","observation_id":"7a722130-f723-4629-8782-a5f7e56d20e8","resolution":{"observed_at":"2026-08-06T12:03:43.102420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.16228","last_updated":"2024-07-11T23:03:09Z","snapshot_observed_at":"2026-08-07T21:43:05.647409Z","submitted_at":"2023-10-24T22:54:05Z","title":"On the Foundations of Shortcut Learning","version":2},"cited_work":{"arxiv_id":"2310.16228","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.16228","snapshot_observed_at":"2026-06-30T10:04:36.010420Z","title":"arXiv preprint arXiv:2310.16228 , year=","venue":null,"work_id":"1637bf5f-0b90-4ab3-9068-057c004d31c5","year":2023},"citing_paper":{"arxiv_id":"2605.11134","last_updated":"2026-05-29T17:16:57Z","snapshot_observed_at":"2026-08-01T16:30:31.998321Z","submitted_at":"2026-05-11T18:41:12Z","title":"Spurious Correlation Learning in Preference Optimization: Mechanisms, Consequences, and Mitigation via Tie Training","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-13T06:30:51.812541Z"},"links":{"cited_paper":"/paper/2310.16228","citing_paper":"/paper/2605.11134"},"observation_digest":"sha256:0a6a4bf747074a4e6840f0f32eccb1bf7d532f6cd2e13a2cf4fd77b787fdc333","observation_id":"856c0eb4-5ff5-4a55-81f0-fba85d7a9216","resolution":{"observed_at":"2026-05-13T06:32:24.276653Z","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":"2310.16228","last_updated":"2024-07-11T23:03:09Z","snapshot_observed_at":"2026-08-07T21:43:05.647409Z","submitted_at":"2023-10-24T22:54:05Z","title":"On the Foundations of Shortcut Learning","version":2},"cited_work":{"arxiv_id":"2310.16228","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.16228","snapshot_observed_at":"2026-06-30T10:04:36.010420Z","title":"arXiv preprint arXiv:2310.16228 , year=","venue":null,"work_id":"1637bf5f-0b90-4ab3-9068-057c004d31c5","year":2023},"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":30,"source":"arxiv_source","source_observed_at":"2026-05-20T21:16:08.255679Z"},"links":{"cited_paper":"/paper/2310.16228","citing_paper":"/paper/2605.15775"},"observation_digest":"sha256:1391ffbebb667138301424fe1be0639cd8ebef62078c684ccf56879557853693","observation_id":"4f2b8238-b25f-4917-97c2-f340919d5b2b","resolution":{"observed_at":"2026-05-20T21:19:03.136763Z","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":"2310.16228","last_updated":"2024-07-11T23:03:09Z","snapshot_observed_at":"2026-08-07T21:43:05.647409Z","submitted_at":"2023-10-24T22:54:05Z","title":"On the Foundations of Shortcut Learning","version":2},"cited_work":{"arxiv_id":"2310.16228","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.16228","snapshot_observed_at":"2026-06-30T10:04:36.010420Z","title":"arXiv preprint arXiv:2310.16228 , year=","venue":null,"work_id":"1637bf5f-0b90-4ab3-9068-057c004d31c5","year":2023},"citing_paper":{"arxiv_id":"2606.28697","last_updated":"2026-06-27T02:44:08Z","snapshot_observed_at":"2026-07-07T00:02:43.396508Z","submitted_at":"2026-06-27T02:44:08Z","title":"Mitigating Batch Effects in Histopathology via Language-Mediated Robust Embedding Generation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-30T10:01:21.792617Z"},"links":{"cited_paper":"/paper/2310.16228","citing_paper":"/paper/2606.28697"},"observation_digest":"sha256:b6f0df6af874422cd4edd0b7cb17157c7779600a3beac70d47a25a8c30dd6357","observation_id":"b41c9a77-a3da-405f-a46b-502573a925a0","resolution":{"observed_at":"2026-06-30T10:04:36.011770Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2310.16228/citation-record","integrity":"/paper/2310.16228/integrity","json":"/paper/2310.16228/citation-record.json","paper":"/paper/2310.16228"},"outbound":[],"paper":{"arxiv_id":"2310.16228","last_updated":"2024-07-11T23:03:09Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T21:43:05.647409Z","submitted_at":"2023-10-24T22:54:05Z","title":"On the Foundations of Shortcut Learning"},"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 4 inbound Pith citation observations for arXiv:2310.16228."}