{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IH3TBO5TB4HEPTX34GYZTUM3KK","short_pith_number":"pith:IH3TBO5T","canonical_record":{"source":{"id":"2506.10911","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-12T17:23:23Z","cross_cats_sorted":[],"title_canon_sha256":"dd6eb3a9578ca4f802d20ee1b141560ec8243fe5c08e139ee135f183debdfcac","abstract_canon_sha256":"0d71b4f6529c1761dbace338726c2e674913225d14e50e61afbae14bc7f1f5b7"},"schema_version":"1.0"},"canonical_sha256":"41f730bbb30f0e47cefbe1b199d19b52938923a57381448f48e0fa689159d5b4","source":{"kind":"arxiv","id":"2506.10911","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.10911","created_at":"2026-07-05T11:20:40Z"},{"alias_kind":"arxiv_version","alias_value":"2506.10911v1","created_at":"2026-07-05T11:20:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.10911","created_at":"2026-07-05T11:20:40Z"},{"alias_kind":"pith_short_12","alias_value":"IH3TBO5TB4HE","created_at":"2026-07-05T11:20:40Z"},{"alias_kind":"pith_short_16","alias_value":"IH3TBO5TB4HEPTX3","created_at":"2026-07-05T11:20:40Z"},{"alias_kind":"pith_short_8","alias_value":"IH3TBO5T","created_at":"2026-07-05T11:20:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IH3TBO5TB4HEPTX34GYZTUM3KK","target":"record","payload":{"canonical_record":{"source":{"id":"2506.10911","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-12T17:23:23Z","cross_cats_sorted":[],"title_canon_sha256":"dd6eb3a9578ca4f802d20ee1b141560ec8243fe5c08e139ee135f183debdfcac","abstract_canon_sha256":"0d71b4f6529c1761dbace338726c2e674913225d14e50e61afbae14bc7f1f5b7"},"schema_version":"1.0"},"canonical_sha256":"41f730bbb30f0e47cefbe1b199d19b52938923a57381448f48e0fa689159d5b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:40.219495Z","signature_b64":"Td8hFC6VGX8n1k07y2PRmuvmA+NjOL0yemRDyFO+HXfdDZQ3JTajPuzMJ39Sjy8drm09bMUoFLEPujDPe7exCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41f730bbb30f0e47cefbe1b199d19b52938923a57381448f48e0fa689159d5b4","last_reissued_at":"2026-07-05T11:20:40.219007Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:40.219007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.10911","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:20:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q1aOWU6Y+ZU4tCJMXNLH9OVouispBNsWqE6h9OYwQH1ks1bMi3CfsbgnydXYKZfIrDABTvzalKS3i96KQqFuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T03:02:33.099192Z"},"content_sha256":"08a88974c4a50dde1c6bc9ead6898cd66c4cc301e4b2ff88cd4f9b675589c236","schema_version":"1.0","event_id":"sha256:08a88974c4a50dde1c6bc9ead6898cd66c4cc301e4b2ff88cd4f9b675589c236"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IH3TBO5TB4HEPTX34GYZTUM3KK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"NoLoCo: No-all-reduce Low Communication Training Method for Large Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Christopher Nies, Jari Kolehmainen, John Donaghy, Nikolay Blagoev, O\\u{g}uzhan Ersoy","submitted_at":"2025-06-12T17:23:23Z","abstract_excerpt":"Training large language models is generally done via optimization methods on clusters containing tens of thousands of accelerators, communicating over a high-bandwidth interconnect. Scaling up these clusters is expensive and can become impractical, imposing limits on the size of models that can be trained. Several recent studies have proposed training methods that are less communication intensive, avoiding the need for a highly connected compute cluster. These state-of-the-art low communication training methods still employ a synchronization step for model parameters, which, when performed ove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.10911","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.10911/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:20:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1FOB35s1muk1yQ94kc6pOoaQSdzF/Mzqc1Imgi3VFVepCTL6gF1m8JJSKrXaCr5fMVp89VANzsRSBj/IfT0QCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T03:02:33.099989Z"},"content_sha256":"45dd826c7b5b9764b5562fa0959893bc647c495f8e44dd85951a7126c2b9a4bd","schema_version":"1.0","event_id":"sha256:45dd826c7b5b9764b5562fa0959893bc647c495f8e44dd85951a7126c2b9a4bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IH3TBO5TB4HEPTX34GYZTUM3KK/bundle.json","state_url":"https://pith.science/pith/IH3TBO5TB4HEPTX34GYZTUM3KK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IH3TBO5TB4HEPTX34GYZTUM3KK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T03:02:33Z","links":{"resolver":"https://pith.science/pith/IH3TBO5TB4HEPTX34GYZTUM3KK","bundle":"https://pith.science/pith/IH3TBO5TB4HEPTX34GYZTUM3KK/bundle.json","state":"https://pith.science/pith/IH3TBO5TB4HEPTX34GYZTUM3KK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IH3TBO5TB4HEPTX34GYZTUM3KK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IH3TBO5TB4HEPTX34GYZTUM3KK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0d71b4f6529c1761dbace338726c2e674913225d14e50e61afbae14bc7f1f5b7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-12T17:23:23Z","title_canon_sha256":"dd6eb3a9578ca4f802d20ee1b141560ec8243fe5c08e139ee135f183debdfcac"},"schema_version":"1.0","source":{"id":"2506.10911","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.10911","created_at":"2026-07-05T11:20:40Z"},{"alias_kind":"arxiv_version","alias_value":"2506.10911v1","created_at":"2026-07-05T11:20:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.10911","created_at":"2026-07-05T11:20:40Z"},{"alias_kind":"pith_short_12","alias_value":"IH3TBO5TB4HE","created_at":"2026-07-05T11:20:40Z"},{"alias_kind":"pith_short_16","alias_value":"IH3TBO5TB4HEPTX3","created_at":"2026-07-05T11:20:40Z"},{"alias_kind":"pith_short_8","alias_value":"IH3TBO5T","created_at":"2026-07-05T11:20:40Z"}],"graph_snapshots":[{"event_id":"sha256:45dd826c7b5b9764b5562fa0959893bc647c495f8e44dd85951a7126c2b9a4bd","target":"graph","created_at":"2026-07-05T11:20:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.10911/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Training large language models is generally done via optimization methods on clusters containing tens of thousands of accelerators, communicating over a high-bandwidth interconnect. Scaling up these clusters is expensive and can become impractical, imposing limits on the size of models that can be trained. Several recent studies have proposed training methods that are less communication intensive, avoiding the need for a highly connected compute cluster. These state-of-the-art low communication training methods still employ a synchronization step for model parameters, which, when performed ove","authors_text":"Christopher Nies, Jari Kolehmainen, John Donaghy, Nikolay Blagoev, O\\u{g}uzhan Ersoy","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-12T17:23:23Z","title":"NoLoCo: No-all-reduce Low Communication Training Method for Large Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.10911","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:08a88974c4a50dde1c6bc9ead6898cd66c4cc301e4b2ff88cd4f9b675589c236","target":"record","created_at":"2026-07-05T11:20:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0d71b4f6529c1761dbace338726c2e674913225d14e50e61afbae14bc7f1f5b7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-12T17:23:23Z","title_canon_sha256":"dd6eb3a9578ca4f802d20ee1b141560ec8243fe5c08e139ee135f183debdfcac"},"schema_version":"1.0","source":{"id":"2506.10911","kind":"arxiv","version":1}},"canonical_sha256":"41f730bbb30f0e47cefbe1b199d19b52938923a57381448f48e0fa689159d5b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41f730bbb30f0e47cefbe1b199d19b52938923a57381448f48e0fa689159d5b4","first_computed_at":"2026-07-05T11:20:40.219007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:20:40.219007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Td8hFC6VGX8n1k07y2PRmuvmA+NjOL0yemRDyFO+HXfdDZQ3JTajPuzMJ39Sjy8drm09bMUoFLEPujDPe7exCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:20:40.219495Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.10911","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08a88974c4a50dde1c6bc9ead6898cd66c4cc301e4b2ff88cd4f9b675589c236","sha256:45dd826c7b5b9764b5562fa0959893bc647c495f8e44dd85951a7126c2b9a4bd"],"state_sha256":"afb20481ff0a085baaaf8ebe2a38381fb4190996568968aebda713ad4c60552a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YLa45reNygWSki1zA0MOm5QcpD1jUEcC/4Y+qv0+pbGHiEddC/WVK8YQUroYksmFDiVgK/cRV/9qdmjiQvDcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T03:02:33.150517Z","bundle_sha256":"5269cdbc56b75bb7b445d3674a672f9f1b6d6eaf8ad9e6bb055b156f1faf7a04"}}