{"as_of":"2026-08-09T06:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e68d7f9aeb041306198ac0ba0351fe88f2fffd7f07dbdc1f9f2416ffffd594b9","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-09T06:31:02.800959+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-07T15:42:23.014357Z","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-03T23:49:03.001697Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.00735","last_updated":"2025-03-05T11:50:24Z","snapshot_observed_at":"2026-08-07T17:36:26.589079Z","submitted_at":"2025-03-02T05:16:43Z","title":"LADDER: Self-Improving LLMs Through Recursive Problem Decomposition","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.00735","snapshot_observed_at":"2026-08-07T15:42:23.014357Z","title":"Ladder: Self-improving llms through recursive problem decomposition","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.14136","last_updated":"2025-07-30T13:53:32Z","snapshot_observed_at":"2026-08-07T15:37:27.738096Z","submitted_at":"2025-05-20T09:39:54Z","title":"Local Mixtures of Experts: Essentially Free Test-Time Training via Model Merging","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T15:42:23.014357Z"},"links":{"cited_paper":"/paper/2503.00735","citing_paper":"/paper/2505.14136"},"observation_digest":"sha256:cd32c219e0ef9510549e8b2bb978a0ce3893114f478954f349c03baf0b5d5838","observation_id":"a274a264-6174-4a1a-8172-681ab2628e82","resolution":{"observed_at":"2026-08-07T15:42:23.014357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.00735","last_updated":"2025-03-05T11:50:24Z","snapshot_observed_at":"2026-08-07T17:36:26.589079Z","submitted_at":"2025-03-02T05:16:43Z","title":"LADDER: Self-Improving LLMs Through Recursive Problem Decomposition","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.00735","snapshot_observed_at":"2026-08-07T04:40:05.083322Z","title":"Simonds and A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10077","last_updated":"2025-07-15T00:08:11Z","snapshot_observed_at":"2026-08-08T06:37:20.755835Z","submitted_at":"2025-06-11T18:00:30Z","title":"A quantum semantic framework for natural language processing","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:40:05.083322Z"},"links":{"cited_paper":"/paper/2503.00735","citing_paper":"/paper/2506.10077"},"observation_digest":"sha256:4b24c9168ce61db935601fe36e8dbc2748d0b7aa3aba8adc58410ba4bd12139a","observation_id":"fa8697ff-159a-4475-b88d-503ef2078db4","resolution":{"observed_at":"2026-08-07T04:40:05.083322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.00735","last_updated":"2025-03-05T11:50:24Z","snapshot_observed_at":"2026-08-07T17:36:26.589079Z","submitted_at":"2025-03-02T05:16:43Z","title":"LADDER: Self-Improving LLMs Through Recursive Problem Decomposition","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.00735","snapshot_observed_at":"2026-08-06T18:01:20.300500Z","title":"arXiv preprint arXiv:2503.00735 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.09389","last_updated":"2025-07-12T20:10:26Z","snapshot_observed_at":"2026-08-09T01:07:52.036710Z","submitted_at":"2025-07-12T20:10:26Z","title":"Knowledge Conceptualization Impacts RAG Efficacy","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T18:01:20.300500Z"},"links":{"cited_paper":"/paper/2503.00735","citing_paper":"/paper/2507.09389"},"observation_digest":"sha256:0c26a1b8176feedf9e1394956a5042902fdf106586aa6c375ee3bd604b2a4517","observation_id":"8348d585-ee15-4ec3-a151-0052011aceeb","resolution":{"observed_at":"2026-08-06T18:01:20.300500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.00735","last_updated":"2025-03-05T11:50:24Z","snapshot_observed_at":"2026-08-07T17:36:26.589079Z","submitted_at":"2025-03-02T05:16:43Z","title":"LADDER: Self-Improving LLMs Through Recursive Problem Decomposition","version":3},"cited_work":{"arxiv_id":"2503.00735","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.00735","snapshot_observed_at":"2026-07-03T23:49:03.001697Z","title":"arXiv preprint arXiv:2503.00735 , year=","venue":null,"work_id":"086380ee-e07e-4629-ba9d-063459efc07f","year":2025},"citing_paper":{"arxiv_id":"2507.21046","last_updated":"2026-01-16T20:59:08Z","snapshot_observed_at":"2026-08-01T06:32:44.461162Z","submitted_at":"2025-07-28T17:59:05Z","title":"A Survey of Self-Evolving Agents: What, When, How, and Where to Evolve on the Path to Artificial Super Intelligence","version":4},"reference_index":264,"source":"arxiv_source","source_observed_at":"2026-05-14T22:23:14.621091Z"},"links":{"cited_paper":"/paper/2503.00735","citing_paper":"/paper/2507.21046"},"observation_digest":"sha256:6f240a1e156ebef19ca488c717c877984663bc6b6616b1a9f33257ded7bf876d","observation_id":"d137a9fa-8c08-4f3f-8be2-ac20e04d49bd","resolution":{"observed_at":"2026-05-14T22:23:15.306803Z","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":"2503.00735","last_updated":"2025-03-05T11:50:24Z","snapshot_observed_at":"2026-08-07T17:36:26.589079Z","submitted_at":"2025-03-02T05:16:43Z","title":"LADDER: Self-Improving LLMs Through Recursive Problem Decomposition","version":3},"cited_work":{"arxiv_id":"2503.00735","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.00735","snapshot_observed_at":"2026-07-03T23:49:03.001697Z","title":"arXiv preprint arXiv:2503.00735 , year=","venue":null,"work_id":"086380ee-e07e-4629-ba9d-063459efc07f","year":2025},"citing_paper":{"arxiv_id":"2605.19444","last_updated":"2026-05-27T03:12:51Z","snapshot_observed_at":"2026-07-06T23:30:11.337726Z","submitted_at":"2026-05-19T06:58:44Z","title":"Detecting and Mitigating the Correct-Answer Extinction Window in Test-Time Reinforcement Learning with Majority Voting","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-20T07:20:50.835826Z"},"links":{"cited_paper":"/paper/2503.00735","citing_paper":"/paper/2605.19444"},"observation_digest":"sha256:4f8465a84c92c43a3bfaead6f1592d739ae541a132b9f53379c1b2c85206133f","observation_id":"a59514b0-5619-4ac0-80ad-4e340ed7eeaf","resolution":{"observed_at":"2026-05-20T07:23:06.918755Z","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":"2503.00735","last_updated":"2025-03-05T11:50:24Z","snapshot_observed_at":"2026-08-07T17:36:26.589079Z","submitted_at":"2025-03-02T05:16:43Z","title":"LADDER: Self-Improving LLMs Through Recursive Problem Decomposition","version":3},"cited_work":{"arxiv_id":"2503.00735","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.00735","snapshot_observed_at":"2026-07-03T23:49:03.001697Z","title":"arXiv preprint arXiv:2503.00735 , year=","venue":null,"work_id":"086380ee-e07e-4629-ba9d-063459efc07f","year":2025},"citing_paper":{"arxiv_id":"2606.18961","last_updated":"2026-06-17T11:42:01Z","snapshot_observed_at":"2026-08-06T13:00:47.933590Z","submitted_at":"2026-06-17T11:42:01Z","title":"Be Your Own Teacher: Steering Protein Language Models via Unsupervised Reward Optimization","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-06-26T21:40:55.946788Z"},"links":{"cited_paper":"/paper/2503.00735","citing_paper":"/paper/2606.18961"},"observation_digest":"sha256:fc1cda92971d57db517917a00b9258239c215095f74478258c8b4974111c1e8d","observation_id":"57e836a3-4673-476d-9953-216cfdca8cb7","resolution":{"observed_at":"2026-07-03T23:49:03.003269Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2503.00735/citation-record","integrity":"/paper/2503.00735/integrity","json":"/paper/2503.00735/citation-record.json","paper":"/paper/2503.00735"},"outbound":[],"paper":{"arxiv_id":"2503.00735","last_updated":"2025-03-05T11:50:24Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T17:36:26.589079Z","submitted_at":"2025-03-02T05:16:43Z","title":"LADDER: Self-Improving LLMs Through Recursive Problem Decomposition"},"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 6 inbound Pith citation observations for arXiv:2503.00735."}