{"as_of":"2026-08-17T04:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:25a81f8ec552c545862568abd068b457df8f1a9c1f7c01da510368b9b750a1f0","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-16T06:30:59.297886+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-11T12:47:48.649408Z","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-04T17:40:00.429978Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.10616","last_updated":"2024-03-15T18:26:51Z","snapshot_observed_at":"2026-08-16T14:09:21.078028Z","submitted_at":"2024-03-15T18:26:51Z","title":"DiPaCo: Distributed Path Composition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.10616","snapshot_observed_at":"2026-08-11T12:47:48.649408Z","title":"DiPaCo: Distributed Path Composition","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13821","last_updated":"2024-12-18T13:10:35Z","snapshot_observed_at":"2026-08-14T15:01:48.830909Z","submitted_at":"2024-12-18T13:10:35Z","title":"Towards Responsible Governing AI Proliferation","version":1},"reference_index":107,"source":"pdf_text","source_observed_at":"2026-08-11T12:47:48.649408Z"},"links":{"cited_paper":"/paper/2403.10616","citing_paper":"/paper/2412.13821"},"observation_digest":"sha256:50c2670a9c731f696c8309782769cf804993d4bb1b3e203d5a2236edbf6eba14","observation_id":"2cb36128-713c-48a7-8058-5f6d3c61a977","resolution":{"observed_at":"2026-08-11T12:47:48.649408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.10616","last_updated":"2024-03-15T18:26:51Z","snapshot_observed_at":"2026-08-16T14:09:21.078028Z","submitted_at":"2024-03-15T18:26:51Z","title":"DiPaCo: Distributed Path Composition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.10616","snapshot_observed_at":"2026-08-07T23:48:00.878478Z","title":"Rusu, Adhiguna Kuncoro, Yani Donchev, Rachita Chhaparia, Ionel Gog, Marc'Aurelio Ranzato, Jiajun Shen, and Arthur Szlam","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08773","last_updated":"2025-07-22T15:27:33Z","snapshot_observed_at":"2026-08-14T02:29:31.486179Z","submitted_at":"2025-02-12T20:30:28Z","title":"Universal Model Routing for Efficient LLM Inference","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T23:48:00.878478Z"},"links":{"cited_paper":"/paper/2403.10616","citing_paper":"/paper/2502.08773"},"observation_digest":"sha256:ae2e14331aa7c5f7411ff150a9a60149a3d0555f76febdcb27c4a124e7ce708f","observation_id":"e702c6c0-7578-412f-ad1f-6cf7ddfd445c","resolution":{"observed_at":"2026-08-07T23:48:00.878478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.10616","last_updated":"2024-03-15T18:26:51Z","snapshot_observed_at":"2026-08-16T14:09:21.078028Z","submitted_at":"2024-03-15T18:26:51Z","title":"DiPaCo: Distributed Path Composition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.10616","snapshot_observed_at":"2026-08-07T04:20:01.483869Z","title":"Dipaco: Distributed path composition.arXiv preprint arXiv:2403.10616,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.10911","last_updated":"2025-06-12T17:23:23Z","snapshot_observed_at":"2026-08-12T21:29:33.396055Z","submitted_at":"2025-06-12T17:23:23Z","title":"NoLoCo: No-all-reduce Low Communication Training Method for Large Models","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:01.483869Z"},"links":{"cited_paper":"/paper/2403.10616","citing_paper":"/paper/2506.10911"},"observation_digest":"sha256:b90f50cb446e3e5db2bbdfbc6729997fb98af4fe84de1e120156bfaadf5869af","observation_id":"4d229f63-2d0b-43a6-bd9c-1b00d23b3a15","resolution":{"observed_at":"2026-08-07T04:20:01.483869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.10616","last_updated":"2024-03-15T18:26:51Z","snapshot_observed_at":"2026-08-16T14:09:21.078028Z","submitted_at":"2024-03-15T18:26:51Z","title":"DiPaCo: Distributed Path Composition","version":1},"cited_work":{"arxiv_id":"2403.10616","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.10616","snapshot_observed_at":"2026-07-04T17:40:00.429978Z","title":"Rusu, et al","venue":null,"work_id":"1d7b021e-fa92-4d84-bd8e-e62a3684ffb1","year":2024},"citing_paper":{"arxiv_id":"2606.19025","last_updated":"2026-06-20T12:18:17Z","snapshot_observed_at":"2026-08-15T15:49:45.612865Z","submitted_at":"2026-06-17T12:50:07Z","title":"FoMoE: Breaking the Full-Replica Barrier with a Federation of MoEs","version":2},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-06-26T21:25:15.709652Z"},"links":{"cited_paper":"/paper/2403.10616","citing_paper":"/paper/2606.19025"},"observation_digest":"sha256:ed4f1f33f566932fdf950ba88e6fbaab200e0a81734eb390495621e55033502b","observation_id":"69894451-c349-4560-a1fb-dcb9593e7689","resolution":{"observed_at":"2026-07-04T00:09:15.145226Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.10616","last_updated":"2024-03-15T18:26:51Z","snapshot_observed_at":"2026-08-16T14:09:21.078028Z","submitted_at":"2024-03-15T18:26:51Z","title":"DiPaCo: Distributed Path Composition","version":1},"cited_work":{"arxiv_id":"2403.10616","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.10616","snapshot_observed_at":"2026-07-04T17:40:00.429978Z","title":"Rusu, et al","venue":null,"work_id":"1d7b021e-fa92-4d84-bd8e-e62a3684ffb1","year":2024},"citing_paper":{"arxiv_id":"2606.24722","last_updated":"2026-07-03T16:29:30Z","snapshot_observed_at":"2026-08-10T00:24:45.716202Z","submitted_at":"2026-06-23T15:47:33Z","title":"Decentralised AI Training and Inference with BlockTrain","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-06-25T23:32:43.585170Z"},"links":{"cited_paper":"/paper/2403.10616","citing_paper":"/paper/2606.24722"},"observation_digest":"sha256:1087ba3a75095a4f73d5824f1eaa957011ab4160d3fb890c9771caaeed3f57df","observation_id":"79c10cbd-2b7f-49ac-a1c1-83e8df8416a4","resolution":{"observed_at":"2026-07-04T17:40:00.431347Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.10616","last_updated":"2024-03-15T18:26:51Z","snapshot_observed_at":"2026-08-16T14:09:21.078028Z","submitted_at":"2024-03-15T18:26:51Z","title":"DiPaCo: Distributed Path Composition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.10616","snapshot_observed_at":"2026-07-12T12:29:35.403453Z","title":"Rusu, et al","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.24722","last_updated":"2026-07-03T16:29:30Z","snapshot_observed_at":"2026-08-10T00:24:45.716202Z","submitted_at":"2026-06-23T15:47:33Z","title":"Decentralised AI Training and Inference with BlockTrain","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-12T12:29:35.403453Z"},"links":{"cited_paper":"/paper/2403.10616","citing_paper":"/paper/2606.24722"},"observation_digest":"sha256:bad3daf14412f2e5f28a492e6a8d6640ad3ce83f640e13c31234642cef83304b","observation_id":"51646666-7d4f-4119-ba3b-3c88e434897f","resolution":{"observed_at":"2026-07-12T12:29:35.403453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2403.10616/citation-record","integrity":"/paper/2403.10616/integrity","json":"/paper/2403.10616/citation-record.json","paper":"/paper/2403.10616"},"outbound":[],"paper":{"arxiv_id":"2403.10616","last_updated":"2024-03-15T18:26:51Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T14:09:21.078028Z","submitted_at":"2024-03-15T18:26:51Z","title":"DiPaCo: Distributed Path Composition"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2403.10616."}