{"as_of":"2026-08-17T00:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3443c6284f8d1c489bef9940a9f137711d2a5ce787d4dcf28993e9560a104786","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:06:23.099446Z","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-01T16:25:50.096535Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.13343","last_updated":"2024-10-17T08:52:52Z","snapshot_observed_at":"2026-08-16T13:08:30.535351Z","submitted_at":"2024-10-17T08:52:52Z","title":"Do LLMs Overcome Shortcut Learning? An Evaluation of Shortcut Challenges in Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13343","snapshot_observed_at":"2026-08-11T20:53:27.037341Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.05152","last_updated":"2024-12-06T16:10:13Z","snapshot_observed_at":"2026-08-14T14:02:11.341249Z","submitted_at":"2024-12-06T16:10:13Z","title":"Navigating Shortcuts, Spurious Correlations, and Confounders: From Origins via Detection to Mitigation","version":1},"reference_index":212,"source":"pdf_text","source_observed_at":"2026-08-11T20:53:27.037341Z"},"links":{"cited_paper":"/paper/2410.13343","citing_paper":"/paper/2412.05152"},"observation_digest":"sha256:4b6e6ee2d074cc800bd834b87826c4f02aa6fa9093b9de07f0be4de1f0cc47b9","observation_id":"d504e783-91b9-466c-a374-4615eae29432","resolution":{"observed_at":"2026-08-11T20:53:27.037341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13343","last_updated":"2024-10-17T08:52:52Z","snapshot_observed_at":"2026-08-16T13:08:30.535351Z","submitted_at":"2024-10-17T08:52:52Z","title":"Do LLMs Overcome Shortcut Learning? An Evaluation of Shortcut Challenges in Large Language Models","version":1},"cited_work":{"arxiv_id":"2410.13343","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.13343","snapshot_observed_at":"2026-07-01T16:25:50.096535Z","title":"Do LLMs overcome shortcut learning? An evaluation of shortcut challenges in large language models","venue":null,"work_id":"abc5e677-a2f5-447a-9238-c7e8e4ba7ead","year":2024},"citing_paper":{"arxiv_id":"2504.19774","last_updated":"2025-04-29T10:54:44Z","snapshot_observed_at":"2026-08-15T03:55:07.090989Z","submitted_at":"2025-04-28T13:18:48Z","title":"If Concept Bottlenecks are the Question, are Foundation Models the Answer?","version":2},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-05-22T17:50:46.539215Z"},"links":{"cited_paper":"/paper/2410.13343","citing_paper":"/paper/2504.19774"},"observation_digest":"sha256:f6db5cfbaf1b02dd6e0eceadbc56994f06a40e85682b44005f63ce05b7e21cd9","observation_id":"41938c65-3042-4641-aa69-bd352b9a093f","resolution":{"observed_at":"2026-05-22T17:51:55.044662Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13343","last_updated":"2024-10-17T08:52:52Z","snapshot_observed_at":"2026-08-16T13:08:30.535351Z","submitted_at":"2024-10-17T08:52:52Z","title":"Do LLMs Overcome Shortcut Learning? An Evaluation of Shortcut Challenges in Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13343","snapshot_observed_at":"2026-08-15T21:06:23.099446Z","title":"Do llms overcome shortcut learning? an evaluation of short- cut challenges in large language models.arXiv preprint arXiv:2410.13343,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.10930","last_updated":"2025-05-31T03:05:23Z","snapshot_observed_at":"2026-08-15T20:58:40.579359Z","submitted_at":"2025-05-16T07:08:47Z","title":"Physics-informed Temporal Alignment for Auto-regressive PDE Foundation Models","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T21:06:23.099446Z"},"links":{"cited_paper":"/paper/2410.13343","citing_paper":"/paper/2505.10930"},"observation_digest":"sha256:5882720cb065a0123391c437601847b621a9364e3f557152797fb964591a712b","observation_id":"efbe8f45-eff9-429e-aa30-2e4097fe2e87","resolution":{"observed_at":"2026-08-15T21:06:23.099446Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13343","last_updated":"2024-10-17T08:52:52Z","snapshot_observed_at":"2026-08-16T13:08:30.535351Z","submitted_at":"2024-10-17T08:52:52Z","title":"Do LLMs Overcome Shortcut Learning? An Evaluation of Shortcut Challenges in Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13343","snapshot_observed_at":"2026-08-05T22:50:43.783324Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.06426","last_updated":"2025-08-08T16:14:01Z","snapshot_observed_at":"2026-08-16T17:50:47.847002Z","submitted_at":"2025-08-08T16:14:01Z","title":"Shortcut Learning in Generalist Robot Policies: The Role of Dataset Diversity and Fragmentation","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-05T22:50:43.783324Z"},"links":{"cited_paper":"/paper/2410.13343","citing_paper":"/paper/2508.06426"},"observation_digest":"sha256:cb90c40e3ad9e104537a9c6b62d801ad73335d66cb086448ffff0ecf15509ead","observation_id":"4396d72d-c56a-46f4-8dce-18bb2d67105d","resolution":{"observed_at":"2026-08-05T22:50:43.783324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13343","last_updated":"2024-10-17T08:52:52Z","snapshot_observed_at":"2026-08-16T13:08:30.535351Z","submitted_at":"2024-10-17T08:52:52Z","title":"Do LLMs Overcome Shortcut Learning? An Evaluation of Shortcut Challenges in Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13343","snapshot_observed_at":"2026-08-05T22:46:44.532064Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.06429","last_updated":"2025-08-08T16:16:43Z","snapshot_observed_at":"2026-08-09T06:56:02.033235Z","submitted_at":"2025-08-08T16:16:43Z","title":"SPARSE Data, Rich Results: Few-Shot Semi-Supervised Learning via Class-Conditioned Image Translation","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-05T22:46:44.532064Z"},"links":{"cited_paper":"/paper/2410.13343","citing_paper":"/paper/2508.06429"},"observation_digest":"sha256:80aac615b836e9297b8e3ea5ff2e8a3cdbf7be191d5cb8bbd113ee9c1c36a536","observation_id":"ef2660fb-d616-4381-8449-cb294b6ec5d7","resolution":{"observed_at":"2026-08-05T22:46:44.532064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13343","last_updated":"2024-10-17T08:52:52Z","snapshot_observed_at":"2026-08-16T13:08:30.535351Z","submitted_at":"2024-10-17T08:52:52Z","title":"Do LLMs Overcome Shortcut Learning? An Evaluation of Shortcut Challenges in Large Language Models","version":1},"cited_work":{"arxiv_id":"2410.13343","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.13343","snapshot_observed_at":"2026-07-01T16:25:50.096535Z","title":"Do LLMs overcome shortcut learning? An evaluation of shortcut challenges in large language models","venue":null,"work_id":"abc5e677-a2f5-447a-9238-c7e8e4ba7ead","year":2024},"citing_paper":{"arxiv_id":"2605.02658","last_updated":"2026-05-05T10:46:41Z","snapshot_observed_at":"2026-08-16T10:30:47.981480Z","submitted_at":"2026-05-04T14:39:10Z","title":"Deciphering Shortcut Learning from an Evolutionary Game Theory Perspective","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-08T19:29:59.568826Z"},"links":{"cited_paper":"/paper/2410.13343","citing_paper":"/paper/2605.02658"},"observation_digest":"sha256:dc61e30ebdeaeb9aa660356dfe9a344b77d3e7d37e813799f5749e019d626239","observation_id":"07dabac8-fc08-4959-b639-a16793d99bcc","resolution":{"observed_at":"2026-05-09T05:50:26.712568Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13343","last_updated":"2024-10-17T08:52:52Z","snapshot_observed_at":"2026-08-16T13:08:30.535351Z","submitted_at":"2024-10-17T08:52:52Z","title":"Do LLMs Overcome Shortcut Learning? An Evaluation of Shortcut Challenges in Large Language Models","version":1},"cited_work":{"arxiv_id":"2410.13343","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.13343","snapshot_observed_at":"2026-07-01T16:25:50.096535Z","title":"Do LLMs overcome shortcut learning? An evaluation of shortcut challenges in large language models","venue":null,"work_id":"abc5e677-a2f5-447a-9238-c7e8e4ba7ead","year":2024},"citing_paper":{"arxiv_id":"2605.11482","last_updated":"2026-05-12T03:56:40Z","snapshot_observed_at":"2026-08-14T08:18:34.896664Z","submitted_at":"2026-05-12T03:56:40Z","title":"NeuroFlake: A Neuro-Symbolic LLM Framework for Flaky Test Classification","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-13T02:10:26.021153Z"},"links":{"cited_paper":"/paper/2410.13343","citing_paper":"/paper/2605.11482"},"observation_digest":"sha256:16a41fb745ca1d60ee9fa80c762ba7170b9e38b2c3c6aaeceb9cbf009b4e8dca","observation_id":"199974fd-9cc0-4193-9c17-6630f20faaf8","resolution":{"observed_at":"2026-05-13T02:12:07.183973Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13343","last_updated":"2024-10-17T08:52:52Z","snapshot_observed_at":"2026-08-16T13:08:30.535351Z","submitted_at":"2024-10-17T08:52:52Z","title":"Do LLMs Overcome Shortcut Learning? An Evaluation of Shortcut Challenges in Large Language Models","version":1},"cited_work":{"arxiv_id":"2410.13343","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.13343","snapshot_observed_at":"2026-07-01T16:25:50.096535Z","title":"Do LLMs overcome shortcut learning? An evaluation of shortcut challenges in large language models","venue":null,"work_id":"abc5e677-a2f5-447a-9238-c7e8e4ba7ead","year":2024},"citing_paper":{"arxiv_id":"2606.28615","last_updated":"2026-06-26T21:14:56Z","snapshot_observed_at":"2026-08-04T19:40:32.344244Z","submitted_at":"2026-06-26T21:14:56Z","title":"What LLMs explain is not what they believe: Evaluating explanation sufficiency under models' own input beliefs","version":1},"reference_index":134,"source":"arxiv_source","source_observed_at":"2026-06-30T00:38:21.949283Z"},"links":{"cited_paper":"/paper/2410.13343","citing_paper":"/paper/2606.28615"},"observation_digest":"sha256:107833bef29c5a13ded3f6efef1bf80fd7b8a68f7ecbd027e6be9b7a11b35a2f","observation_id":"a95b62c1-6350-4e11-8548-729034136a62","resolution":{"observed_at":"2026-07-01T16:25:50.097957Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.13343/citation-record","integrity":"/paper/2410.13343/integrity","json":"/paper/2410.13343/citation-record.json","paper":"/paper/2410.13343"},"outbound":[],"paper":{"arxiv_id":"2410.13343","last_updated":"2024-10-17T08:52:52Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T13:08:30.535351Z","submitted_at":"2024-10-17T08:52:52Z","title":"Do LLMs Overcome Shortcut Learning? An Evaluation of Shortcut Challenges in Large Language Models"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2410.13343."}