{"as_of":"2026-08-10T09:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:81e4febcaf8e81b7491db2e67e552251ea11ac4fd9bcf62546d5feab5d19f2ff","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-10T06:31:04.303077+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-05T17:55:06.756104Z","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-21T19:25:31.172228Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.06589","last_updated":"2025-06-19T06:06:08Z","snapshot_observed_at":"2026-08-10T01:51:32.164438Z","submitted_at":"2025-01-11T17:06:30Z","title":"Ladder-residual: parallelism-aware architecture for accelerating large model inference with communication overlapping","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.06589","snapshot_observed_at":"2026-08-05T17:55:06.756104Z","title":"Ladder-residual: parallelism-aware architecture for accelerating large model inference with communication overlapping","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.15881","last_updated":"2025-08-25T02:24:20Z","snapshot_observed_at":"2026-08-05T17:55:04.790166Z","submitted_at":"2025-08-21T15:25:40Z","title":"TPLA: Tensor Parallel Latent Attention for Efficient Disaggregated Prefill and Decode Inference","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T17:55:06.756104Z"},"links":{"cited_paper":"/paper/2501.06589","citing_paper":"/paper/2508.15881"},"observation_digest":"sha256:77713d3137eb8ccf39576a0120d1b63fa53fd30ee9974e868477d3ab1c42c0fc","observation_id":"f9d7552b-b5c9-49af-b04f-21d5462056a3","resolution":{"observed_at":"2026-08-05T17:55:06.756104Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.06589","last_updated":"2025-06-19T06:06:08Z","snapshot_observed_at":"2026-08-10T01:51:32.164438Z","submitted_at":"2025-01-11T17:06:30Z","title":"Ladder-residual: parallelism-aware architecture for accelerating large model inference with communication overlapping","version":5},"cited_work":{"arxiv_id":"2501.06589","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.06589","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"L., Athiwaratkun, B., and Dao, T","venue":null,"work_id":"d8032358-29a0-4829-af93-5a6521eb6dd8","year":2025},"citing_paper":{"arxiv_id":"2511.09557","last_updated":"2026-05-20T17:50:51Z","snapshot_observed_at":"2026-08-08T17:02:49.917616Z","submitted_at":"2025-11-12T18:59:26Z","title":"Understanding and Improving Communication Performance in Multi-node LLM Inference","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-21T19:24:34.459446Z"},"links":{"cited_paper":"/paper/2501.06589","citing_paper":"/paper/2511.09557"},"observation_digest":"sha256:9aea545e5182232c56f99eade9fcd5e9971f14120cb8b1cf7bccfd70124db0fb","observation_id":"78fbd841-c54b-45aa-8c61-9feaf96db825","resolution":{"observed_at":"2026-05-21T19:25:31.174362Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.06589","last_updated":"2025-06-19T06:06:08Z","snapshot_observed_at":"2026-08-10T01:51:32.164438Z","submitted_at":"2025-01-11T17:06:30Z","title":"Ladder-residual: parallelism-aware architecture for accelerating large model inference with communication overlapping","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.06589","snapshot_observed_at":"2026-08-03T22:13:58.888683Z","title":"Ladder-residual: parallelism-aware architecture for accelerating large model inference with communication overlapping.arXiv preprint arXiv:2501.06589, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.11505","last_updated":"2026-05-27T18:20:06Z","snapshot_observed_at":"2026-08-03T22:13:51.690809Z","submitted_at":"2025-11-14T17:25:14Z","title":"FarSkip-Collective: Unhobbling Blocking Communication in Mixture of Experts Models","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T22:13:58.888683Z"},"links":{"cited_paper":"/paper/2501.06589","citing_paper":"/paper/2511.11505"},"observation_digest":"sha256:f0617e5a2f8130773c5701aa74543592b1069a78ea114188bc4cf92634fe5650","observation_id":"772ae50f-4b76-4bb7-83aa-8f3bb62c1a7e","resolution":{"observed_at":"2026-08-03T22:13:58.888683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.06589","last_updated":"2025-06-19T06:06:08Z","snapshot_observed_at":"2026-08-10T01:51:32.164438Z","submitted_at":"2025-01-11T17:06:30Z","title":"Ladder-residual: parallelism-aware architecture for accelerating large model inference with communication overlapping","version":5},"cited_work":{"arxiv_id":"2501.06589","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.06589","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"L., Athiwaratkun, B., and Dao, T","venue":null,"work_id":"d8032358-29a0-4829-af93-5a6521eb6dd8","year":2025},"citing_paper":{"arxiv_id":"2603.14360","last_updated":"2026-05-13T23:29:01Z","snapshot_observed_at":"2026-08-01T09:38:25.349230Z","submitted_at":"2026-03-15T12:53:09Z","title":"M$^2$RNN: Non-Linear RNNs with Matrix-Valued States for Scalable Language Modeling","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-15T11:35:43.088803Z"},"links":{"cited_paper":"/paper/2501.06589","citing_paper":"/paper/2603.14360"},"observation_digest":"sha256:89f623c7e745c26921cf882f024e5315c804d8afc8bc79095164f3dfdcbb7e55","observation_id":"ff69d1d3-3ebf-4ec3-8f5f-15c43d08848c","resolution":{"observed_at":"2026-05-15T11:39:59.250725Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.06589/citation-record","integrity":"/paper/2501.06589/integrity","json":"/paper/2501.06589/citation-record.json","paper":"/paper/2501.06589"},"outbound":[],"paper":{"arxiv_id":"2501.06589","last_updated":"2025-06-19T06:06:08Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T01:51:32.164438Z","submitted_at":"2025-01-11T17:06:30Z","title":"Ladder-residual: parallelism-aware architecture for accelerating large model inference with communication overlapping"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2501.06589."}