{"as_of":"2026-08-19T06:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f58d4e2d20cf71400dcad15f36dc92f3806cff62954b400f9b7bbd5ed69be5e4","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-19T06:32:44.657259+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-16T00:00:08.665600Z","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-05-22T12:26:31.475032Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.01769","last_updated":"2024-10-03T15:30:12Z","snapshot_observed_at":"2026-08-16T13:13:15.747030Z","submitted_at":"2024-10-02T17:25:37Z","title":"Quantifying Generalization Complexity for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01769","snapshot_observed_at":"2026-08-12T04:34:01.735931Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.01276","last_updated":"2024-12-02T08:44:16Z","snapshot_observed_at":"2026-08-14T22:10:09.373059Z","submitted_at":"2024-12-02T08:44:16Z","title":"Shadow of the (Hierarchical) Tree: Reconciling Symbolic and Predictive Components of the Neural Code for Syntax","version":1},"reference_index":4850,"source":"pdf_text","source_observed_at":"2026-08-12T04:34:01.735931Z"},"links":{"cited_paper":"/paper/2410.01769","citing_paper":"/paper/2412.01276"},"observation_digest":"sha256:3df0deebccdfb83b1d7743a687a2dd7bb48911c25433ae7db7dd6b2c74a367af","observation_id":"2800eb38-53c2-4608-bf0b-728553a1324e","resolution":{"observed_at":"2026-08-12T04:34:01.735931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01769","last_updated":"2024-10-03T15:30:12Z","snapshot_observed_at":"2026-08-16T13:13:15.747030Z","submitted_at":"2024-10-02T17:25:37Z","title":"Quantifying Generalization Complexity for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01769","snapshot_observed_at":"2026-08-10T19:55:50.696642Z","title":"Quantifying generalization complexity for large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.09620","last_updated":"2025-05-29T02:21:03Z","snapshot_observed_at":"2026-08-13T04:40:45.853560Z","submitted_at":"2025-01-16T16:00:37Z","title":"Beyond Reward Hacking: Causal Rewards for Large Language Model Alignment","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-10T19:55:50.696642Z"},"links":{"cited_paper":"/paper/2410.01769","citing_paper":"/paper/2501.09620"},"observation_digest":"sha256:d42ed3009b5d0fb24a67bc0bdfaf8be971989c377f7ccd66d158bf58f87614bb","observation_id":"50ffadf8-a737-471c-9530-de0293a994cf","resolution":{"observed_at":"2026-08-10T19:55:50.696642Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01769","last_updated":"2024-10-03T15:30:12Z","snapshot_observed_at":"2026-08-16T13:13:15.747030Z","submitted_at":"2024-10-02T17:25:37Z","title":"Quantifying Generalization Complexity for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01769","snapshot_observed_at":"2026-08-10T14:33:53.150000Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.17183","last_updated":"2025-02-01T10:18:11Z","snapshot_observed_at":"2026-08-14T22:10:10.376920Z","submitted_at":"2025-01-25T12:26:44Z","title":"LLM Evaluation Based on Aerospace Manufacturing Expertise: Automated Generation and Multi-Model Question Answering","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T14:33:53.150000Z"},"links":{"cited_paper":"/paper/2410.01769","citing_paper":"/paper/2501.17183"},"observation_digest":"sha256:b6a6149e3f7ac6f9596df0ee901f42e9f5810126c8521dc12e406f3f3b6f6ce8","observation_id":"f2127cd4-bde8-49de-89e3-f0afacff5502","resolution":{"observed_at":"2026-08-10T14:33:53.150000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01769","last_updated":"2024-10-03T15:30:12Z","snapshot_observed_at":"2026-08-16T13:13:15.747030Z","submitted_at":"2024-10-02T17:25:37Z","title":"Quantifying Generalization Complexity for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01769","snapshot_observed_at":"2026-08-16T00:00:08.665600Z","title":"Daniel Tan, David Chanin, Aengus Lynch, Dimitrios Kanoulas, Brooks Paige, Adria Garriga- Alonso, and Robert Kirk","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.03189","last_updated":"2025-05-06T05:15:12Z","snapshot_observed_at":"2026-08-18T08:39:27.182713Z","submitted_at":"2025-05-06T05:15:12Z","title":"Patterns and Mechanisms of Contrastive Activation Engineering","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T00:00:08.665600Z"},"links":{"cited_paper":"/paper/2410.01769","citing_paper":"/paper/2505.03189"},"observation_digest":"sha256:ee51cc7602e237d09692f247e2da61efb374cbd81b42a46d93ab39dcdada5f8d","observation_id":"6b08bfed-7aa8-43f9-a237-80e4e7a0f8a8","resolution":{"observed_at":"2026-08-16T00:00:08.665600Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01769","last_updated":"2024-10-03T15:30:12Z","snapshot_observed_at":"2026-08-16T13:13:15.747030Z","submitted_at":"2024-10-02T17:25:37Z","title":"Quantifying Generalization Complexity for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01769","snapshot_observed_at":"2026-08-07T05:54:02.444279Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06729","last_updated":"2025-06-07T09:27:26Z","snapshot_observed_at":"2026-08-14T10:19:50.906658Z","submitted_at":"2025-06-07T09:27:26Z","title":"Mitigating Object Hallucination via Robust Local Perception Search","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:02.444279Z"},"links":{"cited_paper":"/paper/2410.01769","citing_paper":"/paper/2506.06729"},"observation_digest":"sha256:6db78ecf8dc306b150aaa778a97fd4b79e1d0fb4069d9cbbcd53f1aee2b4dddf","observation_id":"c852bc5e-d90a-4530-8dc2-4d1d23b4fed7","resolution":{"observed_at":"2026-08-07T05:54:02.444279Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01769","last_updated":"2024-10-03T15:30:12Z","snapshot_observed_at":"2026-08-16T13:13:15.747030Z","submitted_at":"2024-10-02T17:25:37Z","title":"Quantifying Generalization Complexity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2410.01769","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.01769","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantifying generalization complexity for large language models.arXiv preprint arXiv:2410.01769","venue":null,"work_id":"c4ab970e-3ad5-4363-aa57-366c967b64c9","year":null},"citing_paper":{"arxiv_id":"2601.05106","last_updated":"2026-05-21T03:21:52Z","snapshot_observed_at":"2026-08-17T15:29:45.489637Z","submitted_at":"2026-01-08T16:53:16Z","title":"Token-Level LLM Collaboration via FusionRoute","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-22T12:25:59.747665Z"},"links":{"cited_paper":"/paper/2410.01769","citing_paper":"/paper/2601.05106"},"observation_digest":"sha256:fb21d205fa78f45effed5124eb5fe4b2bc95d518f8d0bba0b6b56cf56e23d831","observation_id":"0ad8330c-4705-4a92-bdb3-34664317f14f","resolution":{"observed_at":"2026-05-22T12:26:31.479889Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01769","last_updated":"2024-10-03T15:30:12Z","snapshot_observed_at":"2026-08-16T13:13:15.747030Z","submitted_at":"2024-10-02T17:25:37Z","title":"Quantifying Generalization Complexity for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01769","snapshot_observed_at":"2026-08-01T06:05:52.898913Z","title":"arXiv preprint arXiv:2410.01769 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22039","last_updated":"2026-07-24T07:08:57Z","snapshot_observed_at":"2026-08-15T05:15:09.557071Z","submitted_at":"2026-07-24T07:08:57Z","title":"Enough is as good as a feast: A Comprehensive Analysis of How Reinforcement Learning Mitigates Task Conflicts in LLMs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T06:05:52.898913Z"},"links":{"cited_paper":"/paper/2410.01769","citing_paper":"/paper/2607.22039"},"observation_digest":"sha256:c960c597de052abdc404451ddaacb286cdad2f8e3eb699d4ed8979a09ac5dd4f","observation_id":"8410c22e-4d1f-4afb-8801-971b92b1665a","resolution":{"observed_at":"2026-08-01T06:05:52.898913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.01769/citation-record","integrity":"/paper/2410.01769/integrity","json":"/paper/2410.01769/citation-record.json","paper":"/paper/2410.01769"},"outbound":[],"paper":{"arxiv_id":"2410.01769","last_updated":"2024-10-03T15:30:12Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T13:13:15.747030Z","submitted_at":"2024-10-02T17:25:37Z","title":"Quantifying Generalization Complexity for 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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2410.01769."}