{"as_of":"2026-08-14T03:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3a2058501273fdd3f1b0a13589e9a19ca9fb662c4edfbc5ee96d17c25cf93fc1","coverage":[{"denominator":3,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:59:02.673350Z","state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T15:21:14.811340Z","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-06-30T13:04:40.487528Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.20252","last_updated":"2025-06-25T08:54:42Z","snapshot_observed_at":"2026-08-10T21:17:56.119017Z","submitted_at":"2025-06-25T08:54:42Z","title":"PAT: a new algorithm for all-gather and reduce-scatter operations at scale","version":1},"cited_work":{"arxiv_id":"2506.20252","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.20252","snapshot_observed_at":"2026-06-30T13:04:40.487528Z","title":"Pat: a new algorithm for all-gather and reduce-scatter operations at scale, 2025.https://arxiv.org/ abs/2506.20252","venue":null,"work_id":"689425f9-88e4-4ec6-b8fc-997b3e29b2bf","year":2025},"citing_paper":{"arxiv_id":"2605.24326","last_updated":"2026-05-23T01:11:19Z","snapshot_observed_at":"2026-07-06T23:34:23.087565Z","submitted_at":"2026-05-23T01:11:19Z","title":"ScaleAcross Explorer: Exploring Communication Optimization for Scale-Across AI Model Training","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-30T12:57:37.344369Z"},"links":{"cited_paper":"/paper/2506.20252","citing_paper":"/paper/2605.24326"},"observation_digest":"sha256:a3533db4b8070c49e7476dfeb6f252f75e1a6d70943c8180106d67c538e78885","observation_id":"c9b294bd-ca1d-4c4e-ab57-574662af32d2","resolution":{"observed_at":"2026-06-30T13:04:40.489185Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.20252","last_updated":"2025-06-25T08:54:42Z","snapshot_observed_at":"2026-08-10T21:17:56.119017Z","submitted_at":"2025-06-25T08:54:42Z","title":"PAT: a new algorithm for all-gather and reduce-scatter operations at scale","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.20252","snapshot_observed_at":"2026-07-11T15:21:14.811340Z","title":"Pat: a new algorithm for all-gather and reduce-scatter operations at scale,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04676","last_updated":"2026-07-06T05:06:37Z","snapshot_observed_at":"2026-08-05T03:48:38.428175Z","submitted_at":"2026-07-06T05:06:37Z","title":"Adaptive Space-efficient Collectives for Dynamic and Unstructured Sparsity on GPU Platforms","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-11T15:21:14.811340Z"},"links":{"cited_paper":"/paper/2506.20252","citing_paper":"/paper/2607.04676"},"observation_digest":"sha256:203d80d0c1e92733779ed1b4b2b89c4797c1a74241d768f348e333b201d53c37","observation_id":"45aed721-fdd7-46b5-a2e6-8092ddc919a9","resolution":{"observed_at":"2026-07-11T15:21:14.811340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.20252/citation-record","integrity":"/paper/2506.20252/integrity","json":"/paper/2506.20252/citation-record.json","paper":"/paper/2506.20252"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:03.330456Z","title":"NVIDIA collective communication library","venue":null,"work_id":"fa5f83b1-0d97-4a3d-8c0e-e0f8642b77a8","year":null},"citing_paper":{"arxiv_id":"2506.20252","last_updated":"2025-06-25T08:54:42Z","snapshot_observed_at":"2026-08-10T21:17:56.119017Z","submitted_at":"2025-06-25T08:54:42Z","title":"PAT: a new algorithm for all-gather and reduce-scatter operations at scale","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:02.475451Z"},"links":{"citing_paper":"/paper/2506.20252"},"observation_digest":"sha256:3c58b4db0eecc312ca131f77484b4debaaf08e14a5168a498043ddfbd77ced6f","observation_id":"c0c82877-b16f-4042-a010-985095277aaa","resolution":{"observed_at":"2026-08-06T22:59:03.434146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:03.023974Z","title":"Efficient algorithms for all-to-all communications in multi-port message-passing systems,","venue":null,"work_id":"a341f041-dfe8-49c9-b618-1ce51927787d","year":1994},"citing_paper":{"arxiv_id":"2506.20252","last_updated":"2025-06-25T08:54:42Z","snapshot_observed_at":"2026-08-10T21:17:56.119017Z","submitted_at":"2025-06-25T08:54:42Z","title":"PAT: a new algorithm for all-gather and reduce-scatter operations at scale","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:02.580629Z"},"links":{"citing_paper":"/paper/2506.20252"},"observation_digest":"sha256:d6f8dc43ba1fcc02b56546b0379cce9b8f3697dca46bb23355ae9da8bdb0e869","observation_id":"0aa7fc77-2b99-42ec-a451-9dd6441d5779","resolution":{"observed_at":"2026-08-06T22:59:03.167593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:02.817422Z","title":"Optimization of collective com- munication operations in mpich,","venue":null,"work_id":"afd3eea5-0b70-467e-8e98-a85979417e0d","year":2005},"citing_paper":{"arxiv_id":"2506.20252","last_updated":"2025-06-25T08:54:42Z","snapshot_observed_at":"2026-08-10T21:17:56.119017Z","submitted_at":"2025-06-25T08:54:42Z","title":"PAT: a new algorithm for all-gather and reduce-scatter operations at scale","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:02.673350Z"},"links":{"citing_paper":"/paper/2506.20252"},"observation_digest":"sha256:a54087ce8e3c61977cd9e5525d3d7ecbef0c6ea208dce49652afac54ee62904e","observation_id":"030c47fc-a488-4208-b805-e81d3387913d","resolution":{"observed_at":"2026-08-06T22:59:02.916318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.20252","last_updated":"2025-06-25T08:54:42Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-10T21:17:56.119017Z","submitted_at":"2025-06-25T08:54:42Z","title":"PAT: a new algorithm for all-gather and reduce-scatter operations at scale"},"reference_resolution":{"displayed":3,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":3},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 3 of 3 outbound references and 2 inbound Pith citation observations for arXiv:2506.20252."}