{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CI3WGCPZTDWEAD7R2CRMDCPHMM","short_pith_number":"pith:CI3WGCPZ","canonical_record":{"source":{"id":"2607.20220","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-07-22T14:38:42Z","cross_cats_sorted":[],"title_canon_sha256":"3d5b29a4e5033a975425249a4349ad2f4be33d3e858a1370a0537f34a21d3f09","abstract_canon_sha256":"312e6c68ba98b8f8e3d553036dceee48d2ef3e698e83a5cae0243ac5c409eab3"},"schema_version":"1.0"},"canonical_sha256":"12376309f998ec400ff1d0a2c189e763114dd1dd287e3a1dda46b4ea791151c9","source":{"kind":"arxiv","id":"2607.20220","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.20220","created_at":"2026-07-23T01:25:08Z"},{"alias_kind":"arxiv_version","alias_value":"2607.20220v1","created_at":"2026-07-23T01:25:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.20220","created_at":"2026-07-23T01:25:08Z"},{"alias_kind":"pith_short_12","alias_value":"CI3WGCPZTDWE","created_at":"2026-07-23T01:25:08Z"},{"alias_kind":"pith_short_16","alias_value":"CI3WGCPZTDWEAD7R","created_at":"2026-07-23T01:25:08Z"},{"alias_kind":"pith_short_8","alias_value":"CI3WGCPZ","created_at":"2026-07-23T01:25:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CI3WGCPZTDWEAD7R2CRMDCPHMM","target":"record","payload":{"canonical_record":{"source":{"id":"2607.20220","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-07-22T14:38:42Z","cross_cats_sorted":[],"title_canon_sha256":"3d5b29a4e5033a975425249a4349ad2f4be33d3e858a1370a0537f34a21d3f09","abstract_canon_sha256":"312e6c68ba98b8f8e3d553036dceee48d2ef3e698e83a5cae0243ac5c409eab3"},"schema_version":"1.0"},"canonical_sha256":"12376309f998ec400ff1d0a2c189e763114dd1dd287e3a1dda46b4ea791151c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T01:25:08.375874Z","signature_b64":"JSk+Ml8REwAPCm2tyfg6oslnYe/639p9zu7a5ebBGnm03TYJcAh2qo1MdjUr2R8XIBK9iQPQoHc6nLpoGwaQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12376309f998ec400ff1d0a2c189e763114dd1dd287e3a1dda46b4ea791151c9","last_reissued_at":"2026-07-23T01:25:08.375032Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T01:25:08.375032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.20220","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-23T01:25:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rW/qm0JUXMVO8ewyM9rEbSGcEHIp2TWRe0uLyOyoA1NtZhyElYDfylovURVaILMimYt1k0HnXYZZcCf/ioE0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:51:29.934424Z"},"content_sha256":"25d22337b192db4f5f85c33fd879c8b86170df7a3bfa9d7f384bd55dd7f3ba51","schema_version":"1.0","event_id":"sha256:25d22337b192db4f5f85c33fd879c8b86170df7a3bfa9d7f384bd55dd7f3ba51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CI3WGCPZTDWEAD7R2CRMDCPHMM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MoX: Efficient MoE Routing on Direct-Connect Topologies","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Daniel Amir, Jakob Krebs, Mark Silberstein, Ori Cohen","submitted_at":"2026-07-22T14:38:42Z","abstract_excerpt":"Optically switched networks suit the regular communication of dense ML models, but MoE introduces sparse, runtime-dependent traffic. We show that efficient offline-optimized routing enables efficient MoE training and inference on direct-connect topologies without the need for MoE traffic matrix or dynamic topology reconfiguration. MoX constructs token-aware multicast trees to reduce bandwidth tax, then uses static, precomputed link weights to balance traffic by solving a restricted multicast tree-packing problem. Using recorded traffic from large MoE models, token-level traces, and ASTRA-sim, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.20220","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/2607.20220/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-23T01:25:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jzgs4UXFaa7g/CbDyvAe1LG/ANLVyU4JVTHWc9rv7UNoUiqcbziJS1Z2qNFlpjTOJWiU0Vg3dLIZERARLhscCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:51:29.934948Z"},"content_sha256":"4479f46e2997d51da3678d6d83c7b21639db04d21d9cbd251f3e577358f2e9ee","schema_version":"1.0","event_id":"sha256:4479f46e2997d51da3678d6d83c7b21639db04d21d9cbd251f3e577358f2e9ee"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:CI3WGCPZTDWEAD7R2CRMDCPHMM","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1051/ro:2004028) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Andreas Baltz and Anand Srivastav. 2004. Fast Approximation of Min- imum Multicast Congestion—Implementation versus Theory.RAIRO Operations Research38, 4 (2004), 319–344. https://doi.org/10.1051/ro: 2004028","arxiv_id":"2607.20220","detector":"doi_compliance","evidence":{"ref_index":6,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1051/ro:","reconstructed_doi":"10.1051/ro:2004028"},"severity":"advisory","ref_index":6,"audited_at":"2026-08-01T10:39:47.776798Z","event_type":"pith.integrity.v1","detected_doi":"10.1051/ro:2004028","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"64902a418b0f879488bdb6968d40a7598945af56bdb5c6f007126a11452be3d2","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15623,"payload_sha256":"02312c6f31f3adf743c44592baf0d6ed3c404ed31deea49da018b13c94202aed","signature_b64":"NeYPLvtomoh9p/+0VkyqIG/JliKdAd9Dv9vcb5FHyfPJJ6l2pP5QzQAREY+w01SzEEzg7nXbUt7o819K8Um1Aw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T10:43:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vm9kzeZ1W4wjN/3H2SrJKDM0ekQq4T0HCDp3hsv7jVB39c6IlknO0DKLgLvsMVrxgQt9XfM9nB5mDW/riNrxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:51:29.938807Z"},"content_sha256":"5c52022c3673766b807b0fb2f937dfcfea95e9da36555dfa57b7e47b93b26d3b","schema_version":"1.0","event_id":"sha256:5c52022c3673766b807b0fb2f937dfcfea95e9da36555dfa57b7e47b93b26d3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CI3WGCPZTDWEAD7R2CRMDCPHMM/bundle.json","state_url":"https://pith.science/pith/CI3WGCPZTDWEAD7R2CRMDCPHMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CI3WGCPZTDWEAD7R2CRMDCPHMM/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-08T12:51:29Z","links":{"resolver":"https://pith.science/pith/CI3WGCPZTDWEAD7R2CRMDCPHMM","bundle":"https://pith.science/pith/CI3WGCPZTDWEAD7R2CRMDCPHMM/bundle.json","state":"https://pith.science/pith/CI3WGCPZTDWEAD7R2CRMDCPHMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CI3WGCPZTDWEAD7R2CRMDCPHMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CI3WGCPZTDWEAD7R2CRMDCPHMM","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"312e6c68ba98b8f8e3d553036dceee48d2ef3e698e83a5cae0243ac5c409eab3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-07-22T14:38:42Z","title_canon_sha256":"3d5b29a4e5033a975425249a4349ad2f4be33d3e858a1370a0537f34a21d3f09"},"schema_version":"1.0","source":{"id":"2607.20220","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.20220","created_at":"2026-07-23T01:25:08Z"},{"alias_kind":"arxiv_version","alias_value":"2607.20220v1","created_at":"2026-07-23T01:25:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.20220","created_at":"2026-07-23T01:25:08Z"},{"alias_kind":"pith_short_12","alias_value":"CI3WGCPZTDWE","created_at":"2026-07-23T01:25:08Z"},{"alias_kind":"pith_short_16","alias_value":"CI3WGCPZTDWEAD7R","created_at":"2026-07-23T01:25:08Z"},{"alias_kind":"pith_short_8","alias_value":"CI3WGCPZ","created_at":"2026-07-23T01:25:08Z"}],"graph_snapshots":[{"event_id":"sha256:4479f46e2997d51da3678d6d83c7b21639db04d21d9cbd251f3e577358f2e9ee","target":"graph","created_at":"2026-07-23T01:25:08Z","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/2607.20220/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optically switched networks suit the regular communication of dense ML models, but MoE introduces sparse, runtime-dependent traffic. We show that efficient offline-optimized routing enables efficient MoE training and inference on direct-connect topologies without the need for MoE traffic matrix or dynamic topology reconfiguration. MoX constructs token-aware multicast trees to reduce bandwidth tax, then uses static, precomputed link weights to balance traffic by solving a restricted multicast tree-packing problem. Using recorded traffic from large MoE models, token-level traces, and ASTRA-sim, ","authors_text":"Daniel Amir, Jakob Krebs, Mark Silberstein, Ori Cohen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-07-22T14:38:42Z","title":"MoX: Efficient MoE Routing on Direct-Connect Topologies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.20220","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:25d22337b192db4f5f85c33fd879c8b86170df7a3bfa9d7f384bd55dd7f3ba51","target":"record","created_at":"2026-07-23T01:25:08Z","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":"312e6c68ba98b8f8e3d553036dceee48d2ef3e698e83a5cae0243ac5c409eab3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-07-22T14:38:42Z","title_canon_sha256":"3d5b29a4e5033a975425249a4349ad2f4be33d3e858a1370a0537f34a21d3f09"},"schema_version":"1.0","source":{"id":"2607.20220","kind":"arxiv","version":1}},"canonical_sha256":"12376309f998ec400ff1d0a2c189e763114dd1dd287e3a1dda46b4ea791151c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12376309f998ec400ff1d0a2c189e763114dd1dd287e3a1dda46b4ea791151c9","first_computed_at":"2026-07-23T01:25:08.375032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-23T01:25:08.375032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JSk+Ml8REwAPCm2tyfg6oslnYe/639p9zu7a5ebBGnm03TYJcAh2qo1MdjUr2R8XIBK9iQPQoHc6nLpoGwaQBw==","signature_status":"signed_v1","signed_at":"2026-07-23T01:25:08.375874Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.20220","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25d22337b192db4f5f85c33fd879c8b86170df7a3bfa9d7f384bd55dd7f3ba51","sha256:4479f46e2997d51da3678d6d83c7b21639db04d21d9cbd251f3e577358f2e9ee","sha256:5c52022c3673766b807b0fb2f937dfcfea95e9da36555dfa57b7e47b93b26d3b"],"state_sha256":"2514a6937c37c982606c02294cf186d1791af7da095558229d6ffe071787f182"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rO3UqZa5tvh8H9YZZeJB87iSHUspspwn5LDYHOkLBf1jmKx6aUbzxx1Itbaz0S/cbvFTmxwh1BXOGbGvBlBGDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T12:51:29.940913Z","bundle_sha256":"23fccd70be8a6c3bab018b60b27c59b53bfac78e77e9ff976537d49981d66e4b"}}