{"as_of":"2026-08-08T08:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1dae676969df8552bb5c4b123f85e94d025f5c4a4ac00c9648614ade213bef14","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T22:50:43.783324Z","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-07-06T19:35:08.846184Z","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-07-06T02:11:23.670680Z","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:29b42fe4450401bdb67b0222fb7128c53999679ad5ccd026e9015727a57d6a07","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T19:35:08.846184Z","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-07T03:09:20.958694Z","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:df2bfdb36a1aa29aa259be4787fc4e41898b594ecf5dae7760a6fcb5606f5614","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-07-06T19:35:08.846184Z","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-06T08:09:31.684688Z","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:fdfed0f23a3cd42cb97c2d42334856e2c511053dfc8ed9494ff8556a35b3124a","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-07-06T19:35:08.846184Z","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-02T12:50:00.142433Z","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:3c19292ffa952f199bd1c1fb09bb003dd903d8d5d7fba38fbbb5d788071db334","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T19:35:08.846184Z","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-07-06T23:23:21.034839Z","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:f4bc2b7ed4fe25301f1b7970e72a66ef3ab0fcc92ea7fcded78fa50e83a8fbd6","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T19:35:08.846184Z","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:d360e7885df3298d1a3332891b21bbb6117835f4e9978a588567e912143ca2fc","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T19:35:08.846184Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2410.13343."}