{"as_of":"2026-08-07T05:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1a7ea9b32b71a98ed884f3f4689106e27bee3bf36b5c2e7f84f25980b6486611","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T04:17:27.886133Z","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-10T00:24:46.787970Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.11525","last_updated":"2025-05-19T13:48:45Z","snapshot_observed_at":"2026-07-06T20:37:37.864423Z","submitted_at":"2025-02-17T07:54:50Z","title":"Beyond Single-Task: Robust Multi-Task Length Generalization for LLMs","version":2},"cited_work":{"arxiv_id":"2502.11525","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.11525","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2502.11525 , year=","venue":null,"work_id":"cde34ddb-5ce8-4c57-855c-9cf826a50d28","year":2025},"citing_paper":{"arxiv_id":"2604.20811","last_updated":"2026-04-22T17:43:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-22T17:43:05Z","title":"Diagnosing CFG Interpretation in LLMs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-10T00:24:09.265532Z"},"links":{"cited_paper":"/paper/2502.11525","citing_paper":"/paper/2604.20811"},"observation_digest":"sha256:08ac6677f20712efcd279edd1d09726d1f67de63cb9c5cdfefb5bd0148da193a","observation_id":"2fadaa12-467c-498c-9b2e-2bfcad8fa3ff","resolution":{"observed_at":"2026-05-10T00:24:46.789745Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11525","last_updated":"2025-05-19T13:48:45Z","snapshot_observed_at":"2026-07-06T20:37:37.864423Z","submitted_at":"2025-02-17T07:54:50Z","title":"Beyond Single-Task: Robust Multi-Task Length Generalization for LLMs","version":2},"cited_work":{"arxiv_id":"2502.11525","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.11525","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2502.11525 , year=","venue":null,"work_id":"cde34ddb-5ce8-4c57-855c-9cf826a50d28","year":2025},"citing_paper":{"arxiv_id":"2605.02452","last_updated":"2026-05-04T10:56:05Z","snapshot_observed_at":"2026-08-02T17:05:44.125833Z","submitted_at":"2026-05-04T10:56:05Z","title":"Position: How can Graphs Help Large Language Models?","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-05-08T18:48:03.257015Z"},"links":{"cited_paper":"/paper/2502.11525","citing_paper":"/paper/2605.02452"},"observation_digest":"sha256:d2ea6659c36c44bb7cac64c4f654b4ed6d5e6067ed32cae5ec01cd6b564c6b35","observation_id":"e9c897b1-7da6-4e59-84a2-311d5c62adf8","resolution":{"observed_at":"2026-05-09T06:10:43.076782Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11525","last_updated":"2025-05-19T13:48:45Z","snapshot_observed_at":"2026-07-06T20:37:37.864423Z","submitted_at":"2025-02-17T07:54:50Z","title":"Beyond Single-Task: Robust Multi-Task Length Generalization for LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.11525","snapshot_observed_at":"2026-08-01T20:28:12.074212Z","title":"Beyond single-task: Robust multi-task length generalization for llms.arXiv preprint arXiv:2502.11525, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16637","last_updated":"2026-08-02T05:31:50Z","snapshot_observed_at":"2026-08-06T23:24:48.920321Z","submitted_at":"2026-07-18T04:50:23Z","title":"TopoTuner: Topological Finetuning of Large Language Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T20:28:12.074212Z"},"links":{"cited_paper":"/paper/2502.11525","citing_paper":"/paper/2607.16637"},"observation_digest":"sha256:4c3543dea9900c227450e86aac1a53ee41eff226031989d68c03da94105fb06b","observation_id":"c3417bff-0a1f-454c-96c4-fd12fc4757a5","resolution":{"observed_at":"2026-08-01T20:28:12.074212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11525","last_updated":"2025-05-19T13:48:45Z","snapshot_observed_at":"2026-07-06T20:37:37.864423Z","submitted_at":"2025-02-17T07:54:50Z","title":"Beyond Single-Task: Robust Multi-Task Length Generalization for LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.11525","snapshot_observed_at":"2026-08-04T04:17:27.886133Z","title":"Beyond single-task: Robust multi-task length generalization for llms.arXiv preprint arXiv:2502.11525, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16637","last_updated":"2026-08-02T05:31:50Z","snapshot_observed_at":"2026-08-06T23:24:48.920321Z","submitted_at":"2026-07-18T04:50:23Z","title":"TopoTuner: Topological Finetuning of Large Language Models","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T04:17:27.886133Z"},"links":{"cited_paper":"/paper/2502.11525","citing_paper":"/paper/2607.16637"},"observation_digest":"sha256:8d9dca99bcae0546906c049ae1653d4de58478f3a9ca5944d8e8a6a16eaafc2f","observation_id":"6f80fc4e-7ca1-4222-961a-15a12c9ceed7","resolution":{"observed_at":"2026-08-04T04:17:27.886133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.11525/citation-record","integrity":"/paper/2502.11525/integrity","json":"/paper/2502.11525/citation-record.json","paper":"/paper/2502.11525"},"outbound":[],"paper":{"arxiv_id":"2502.11525","last_updated":"2025-05-19T13:48:45Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T20:37:37.864423Z","submitted_at":"2025-02-17T07:54:50Z","title":"Beyond Single-Task: Robust Multi-Task Length Generalization for 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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2502.11525."}