{"as_of":"2026-08-09T06:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f2202a2fb0792288ba085475294879c45ab67f36a139e865135e960fa3356504","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:08:16.178310Z","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-03T10:27:56.414590Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.02257","last_updated":"2024-10-15T18:37:03Z","snapshot_observed_at":"2026-07-06T19:10:04.150678Z","submitted_at":"2024-09-03T19:31:03Z","title":"MMLU-Pro+: Evaluating Higher-Order Reasoning and Shortcut Learning in LLMs","version":3},"cited_work":{"arxiv_id":"2409.02257","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.02257","snapshot_observed_at":"2026-07-03T10:27:56.414590Z","title":"arXiv preprint arXiv:2409.02257 , year=","venue":null,"work_id":"a3c7049a-9821-434c-90f3-286b60d49823","year":2024},"citing_paper":{"arxiv_id":"2501.14249","last_updated":"2026-02-20T04:23:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-24T05:27:46Z","title":"Humanity's Last Exam","version":10},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-10T18:40:50.139345Z"},"links":{"cited_paper":"/paper/2409.02257","citing_paper":"/paper/2501.14249"},"observation_digest":"sha256:7ad7047fb5a98d352847b4a4b449bb31457e6a2f23f5cabce4eea632d67f774e","observation_id":"1655239c-4031-40f4-a026-1ef5bfe7dc84","resolution":{"observed_at":"2026-05-10T18:40:50.292773Z","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":"2409.02257","last_updated":"2024-10-15T18:37:03Z","snapshot_observed_at":"2026-07-06T19:10:04.150678Z","submitted_at":"2024-09-03T19:31:03Z","title":"MMLU-Pro+: Evaluating Higher-Order Reasoning and Shortcut Learning in LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.02257","snapshot_observed_at":"2026-08-07T12:08:16.178310Z","title":"MMLU-Pro+: Evaluating higher-order reasoning and shortcut learning in llms.arXiv preprint arXiv:2409.02257, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00482","last_updated":"2025-05-31T09:24:32Z","snapshot_observed_at":"2026-08-07T12:01:57.559855Z","submitted_at":"2025-05-31T09:24:32Z","title":"BenchHub: A Unified Benchmark Suite for Holistic and Customizable LLM Evaluation","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:16.178310Z"},"links":{"cited_paper":"/paper/2409.02257","citing_paper":"/paper/2506.00482"},"observation_digest":"sha256:cc61ddda81eb4d93e10fe462856aa994db834959c8444b1119bc20669eebcd4b","observation_id":"f7a0cb8e-86be-4b03-ac03-4c9eb57a57ad","resolution":{"observed_at":"2026-08-07T12:08:16.178310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.02257","last_updated":"2024-10-15T18:37:03Z","snapshot_observed_at":"2026-07-06T19:10:04.150678Z","submitted_at":"2024-09-03T19:31:03Z","title":"MMLU-Pro+: Evaluating Higher-Order Reasoning and Shortcut Learning in LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.02257","snapshot_observed_at":"2026-08-06T21:34:15.598649Z","title":"Behrooz Tahmasebi and Stefanie Jegelka","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.23908","last_updated":"2025-06-30T14:37:50Z","snapshot_observed_at":"2026-08-07T21:55:54.380963Z","submitted_at":"2025-06-30T14:37:50Z","title":"Beyond Statistical Learning: Exact Learning Is Essential for General Intelligence","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T21:34:15.598649Z"},"links":{"cited_paper":"/paper/2409.02257","citing_paper":"/paper/2506.23908"},"observation_digest":"sha256:469b5df17ac88bfa91796b94e2ac587f53ab616303944de347bb0331c6db4492","observation_id":"017184d3-39eb-4eca-aa18-9bf6a83c9bcc","resolution":{"observed_at":"2026-08-06T21:34:15.598649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.02257","last_updated":"2024-10-15T18:37:03Z","snapshot_observed_at":"2026-07-06T19:10:04.150678Z","submitted_at":"2024-09-03T19:31:03Z","title":"MMLU-Pro+: Evaluating Higher-Order Reasoning and Shortcut Learning in LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.02257","snapshot_observed_at":"2026-08-06T14:44:09.424893Z","title":"MMLU-Pro+: Evaluating Higher-Order Reasoning and Shortcut Learning in LLMs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.17747","last_updated":"2025-08-08T01:56:30Z","snapshot_observed_at":"2026-08-06T14:37:08.284816Z","submitted_at":"2025-07-23T17:58:14Z","title":"Pretraining on the Test Set Is No Longer All You Need: A Debate-Driven Approach to QA Benchmarks","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-06T14:44:09.424893Z"},"links":{"cited_paper":"/paper/2409.02257","citing_paper":"/paper/2507.17747"},"observation_digest":"sha256:40c546fb2bbbc24da08d5d262096626ba70e84068112f2abe497c82ff36c3591","observation_id":"9717d2a1-315a-4ac1-b51d-f7940e0fb2e5","resolution":{"observed_at":"2026-08-06T14:44:09.424893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.02257","last_updated":"2024-10-15T18:37:03Z","snapshot_observed_at":"2026-07-06T19:10:04.150678Z","submitted_at":"2024-09-03T19:31:03Z","title":"MMLU-Pro+: Evaluating Higher-Order Reasoning and Shortcut Learning in LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.02257","snapshot_observed_at":"2026-08-06T14:11:13.013412Z","title":"arXiv preprint arXiv:2409.02257 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.19699","last_updated":"2025-07-25T22:35:10Z","snapshot_observed_at":"2026-08-07T22:53:22.048383Z","submitted_at":"2025-07-25T22:35:10Z","title":"Towards Inclusive NLP: Assessing Compressed Multilingual Transformers across Diverse Language Benchmarks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T14:11:13.013412Z"},"links":{"cited_paper":"/paper/2409.02257","citing_paper":"/paper/2507.19699"},"observation_digest":"sha256:bc2e1d1649c7e75f85135eff87c2137c04fa41ea939df11615dc0df9a35c7279","observation_id":"563518c4-1ddd-463c-b440-57685e23b800","resolution":{"observed_at":"2026-08-06T14:11:13.013412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.02257","last_updated":"2024-10-15T18:37:03Z","snapshot_observed_at":"2026-07-06T19:10:04.150678Z","submitted_at":"2024-09-03T19:31:03Z","title":"MMLU-Pro+: Evaluating Higher-Order Reasoning and Shortcut Learning in LLMs","version":3},"cited_work":{"arxiv_id":"2409.02257","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.02257","snapshot_observed_at":"2026-07-03T10:27:56.414590Z","title":"arXiv preprint arXiv:2409.02257 , year=","venue":null,"work_id":"a3c7049a-9821-434c-90f3-286b60d49823","year":2024},"citing_paper":{"arxiv_id":"2606.12087","last_updated":"2026-06-10T13:49:11Z","snapshot_observed_at":"2026-08-02T15:03:50.335992Z","submitted_at":"2026-06-10T13:49:11Z","title":"FORT-Searcher: Synthesizing Shortcut-Resistant Search Tasks for Training Deep Search Agents","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-06-27T10:01:45.332920Z"},"links":{"cited_paper":"/paper/2409.02257","citing_paper":"/paper/2606.12087"},"observation_digest":"sha256:ad42ee4b8a8e6b00731a1f5168f3eebcbf51727149d3d87d99faf14265f1df51","observation_id":"b946c5ab-c600-4479-b564-76e9885faa7d","resolution":{"observed_at":"2026-07-03T10:27:56.415938Z","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":"2409.02257","last_updated":"2024-10-15T18:37:03Z","snapshot_observed_at":"2026-07-06T19:10:04.150678Z","submitted_at":"2024-09-03T19:31:03Z","title":"MMLU-Pro+: Evaluating Higher-Order Reasoning and Shortcut Learning in LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.02257","snapshot_observed_at":"2026-08-01T03:01:56.282390Z","title":"arXiv preprint arXiv:2409.02257 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25271","last_updated":"2026-07-28T04:18:49Z","snapshot_observed_at":"2026-08-08T08:44:07.330246Z","submitted_at":"2026-07-28T04:18:49Z","title":"Bridging Compute- and Data-Optimal Pretraining","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T03:01:56.282390Z"},"links":{"cited_paper":"/paper/2409.02257","citing_paper":"/paper/2607.25271"},"observation_digest":"sha256:17f2f5a236df6b70a8dd9a90c0d6ac177a063754bfa2a876de3d3c5e50c93453","observation_id":"de5ad9f1-22a0-4a63-b019-4a7a6bcd612b","resolution":{"observed_at":"2026-08-01T03:01:56.282390Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2409.02257/citation-record","integrity":"/paper/2409.02257/integrity","json":"/paper/2409.02257/citation-record.json","paper":"/paper/2409.02257"},"outbound":[],"paper":{"arxiv_id":"2409.02257","last_updated":"2024-10-15T18:37:03Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T19:10:04.150678Z","submitted_at":"2024-09-03T19:31:03Z","title":"MMLU-Pro+: Evaluating Higher-Order Reasoning and Shortcut Learning in LLMs"},"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 7 inbound Pith citation observations for arXiv:2409.02257."}