{"as_of":"2026-08-10T05:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0ec66d05b917b2c22210dc1a9576d0cab3d94487d2fee3a29516ffbd5a60ed0f","coverage":[{"denominator":7,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T14:33:17.337479Z","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":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2502.06738/citation-record","integrity":"/paper/2502.06738/integrity","json":"/paper/2502.06738/citation-record.json","paper":"/paper/2502.06738"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.01648","last_updated":"2024-07-11T09:32:19Z","snapshot_observed_at":"2026-08-10T04:45:23.812181Z","submitted_at":"2023-12-04T06:01:32Z","title":"Characterizing Large Language Model Geometry Helps Solve Toxicity Detection and Generation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.01648","snapshot_observed_at":"2026-08-08T14:33:17.200609Z","title":"(2024, July)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06738","last_updated":"2025-02-10T18:07:09Z","snapshot_observed_at":"2026-08-09T02:25:09.567864Z","submitted_at":"2025-02-10T18:07:09Z","title":"Resurrecting saturated LLM benchmarks with adversarial encoding","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T14:33:17.200609Z"},"links":{"cited_paper":"/paper/2312.01648","citing_paper":"/paper/2502.06738"},"observation_digest":"sha256:c3a67f26dee17d35a89a7d3872d5ba0d49ff43e5b6645e6fc65c4bbef49c42c5","observation_id":"501ad800-ebb2-4b3b-9227-a0ed7aec9f4e","resolution":{"observed_at":"2026-08-08T14:33:17.200609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.03300","last_updated":"2021-01-12T18:57:11Z","snapshot_observed_at":"2026-08-09T10:28:06.906299Z","submitted_at":"2020-09-07T17:59:25Z","title":"Measuring Massive Multitask Language Understanding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.03300","snapshot_observed_at":"2026-08-08T14:33:17.232253Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.06738","last_updated":"2025-02-10T18:07:09Z","snapshot_observed_at":"2026-08-09T02:25:09.567864Z","submitted_at":"2025-02-10T18:07:09Z","title":"Resurrecting saturated LLM benchmarks with adversarial encoding","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T14:33:17.232253Z"},"links":{"cited_paper":"/paper/2009.03300","citing_paper":"/paper/2502.06738"},"observation_digest":"sha256:607c2ac9475ace40ec1164f2ca37e9907a6338c4ea70d064ff6d146aa2fe8012","observation_id":"bda0e274-b3b8-4f1b-8a82-d6efe9ec049d","resolution":{"observed_at":"2026-08-08T14:33:17.232253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:17.478325Z","title":null,"venue":null,"work_id":"711bc210-ecca-40e4-997a-5ab9d0241876","year":2023},"citing_paper":{"arxiv_id":"2502.06738","last_updated":"2025-02-10T18:07:09Z","snapshot_observed_at":"2026-08-09T02:25:09.567864Z","submitted_at":"2025-02-10T18:07:09Z","title":"Resurrecting saturated LLM benchmarks with adversarial encoding","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T14:33:17.263517Z"},"links":{"citing_paper":"/paper/2502.06738"},"observation_digest":"sha256:28e34a5b69eb952444af3f9553ef7ebf52c358632eac627553f1984b086466ae","observation_id":"e618dcf9-7b2c-46e6-ba19-ceb623dd2756","resolution":{"observed_at":"2026-08-08T14:33:17.482433Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2410.05229","last_updated":"2025-08-27T16:24:39Z","snapshot_observed_at":"2026-07-06T19:29:09.714725Z","submitted_at":"2024-10-07T17:36:37Z","title":"GSM-Symbolic: Understanding the Limitations of Mathematical Reasoning in Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.05229","snapshot_observed_at":"2026-08-08T14:33:17.281392Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06738","last_updated":"2025-02-10T18:07:09Z","snapshot_observed_at":"2026-08-09T02:25:09.567864Z","submitted_at":"2025-02-10T18:07:09Z","title":"Resurrecting saturated LLM benchmarks with adversarial encoding","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T14:33:17.281392Z"},"links":{"cited_paper":"/paper/2410.05229","citing_paper":"/paper/2502.06738"},"observation_digest":"sha256:cad8f14211ddfde12fa666739eeb242b57097b6545082be788cbdb6d35376bc8","observation_id":"b637f7dc-40ba-476a-aae5-ac67b0dab463","resolution":{"observed_at":"2026-08-08T14:33:17.281392Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:17.464025Z","title":"M., Weber, L., Choshen, L., Sun, Y., Xu, G., & Yurochkin, M","venue":null,"work_id":"b0632cc5-76c5-439d-bf95-a0e3541b2291","year":2024},"citing_paper":{"arxiv_id":"2502.06738","last_updated":"2025-02-10T18:07:09Z","snapshot_observed_at":"2026-08-09T02:25:09.567864Z","submitted_at":"2025-02-10T18:07:09Z","title":"Resurrecting saturated LLM benchmarks with adversarial encoding","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T14:33:17.303773Z"},"links":{"citing_paper":"/paper/2502.06738"},"observation_digest":"sha256:fc66ffed85f0add1f97ded634a61ad02b708f3ddad756bb905485b5e48f27292","observation_id":"c5045eaf-401a-42b3-9f11-3c5aa05e49cd","resolution":{"observed_at":"2026-08-08T14:33:17.468072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2406.10786","last_updated":"2025-06-21T20:28:53Z","snapshot_observed_at":"2026-08-10T03:44:53.928636Z","submitted_at":"2024-06-16T02:52:32Z","title":"Evaluating LLMs with Multiple Problems at once","version":3},"cited_work":{"arxiv_id":"2406.10786","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.10786","snapshot_observed_at":"2026-08-08T14:33:17.412443Z","title":"Evaluating LLMs with Multiple Problems at once","venue":"cs.AI","work_id":"29d1051a-99e1-4d82-a2dc-4bf16e691024","year":2024},"citing_paper":{"arxiv_id":"2502.06738","last_updated":"2025-02-10T18:07:09Z","snapshot_observed_at":"2026-08-09T02:25:09.567864Z","submitted_at":"2025-02-10T18:07:09Z","title":"Resurrecting saturated LLM benchmarks with adversarial encoding","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T14:33:17.319689Z"},"links":{"cited_paper":"/paper/2406.10786","citing_paper":"/paper/2502.06738"},"observation_digest":"sha256:3f21a7cbd9329db6b86309c6e5312cd31024dec1b1e305fd01896b820174cf3b","observation_id":"833f2b1b-0d99-4dff-b062-285a0902cf16","resolution":{"observed_at":"2026-08-08T14:33:17.424768Z","resolver_source":"local_arxiv","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":"2309.03882","last_updated":"2024-02-22T01:40:35Z","snapshot_observed_at":"2026-08-06T19:10:47.693909Z","submitted_at":"2023-09-07T17:44:56Z","title":"Large Language Models Are Not Robust Multiple Choice Selectors","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.03882","snapshot_observed_at":"2026-08-08T14:33:17.337479Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06738","last_updated":"2025-02-10T18:07:09Z","snapshot_observed_at":"2026-08-09T02:25:09.567864Z","submitted_at":"2025-02-10T18:07:09Z","title":"Resurrecting saturated LLM benchmarks with adversarial encoding","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T14:33:17.337479Z"},"links":{"cited_paper":"/paper/2309.03882","citing_paper":"/paper/2502.06738"},"observation_digest":"sha256:d1fe1adb9135ca59f4709130358e5372f7801283f0caf82dded85767909392f2","observation_id":"a1caf82e-42e9-4443-a364-aec25bb9945c","resolution":{"observed_at":"2026-08-08T14:33:17.337479Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.06738","last_updated":"2025-02-10T18:07:09Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T02:25:09.567864Z","submitted_at":"2025-02-10T18:07:09Z","title":"Resurrecting saturated LLM benchmarks with adversarial encoding"},"reference_resolution":{"displayed":7,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":1},"total_outbound_references":7},"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 7 of 7 outbound references and 0 inbound Pith citation observations for arXiv:2502.06738."}