{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:BXLXWU4TFJD635I2LQTKY7ULZ4","short_pith_number":"pith:BXLXWU4T","canonical_record":{"source":{"id":"2604.15261","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-04-16T17:37:04Z","cross_cats_sorted":[],"title_canon_sha256":"7461b5b1f73b173b8858830f5466e6df098b1feaa07ed7e7ef833beb6168c207","abstract_canon_sha256":"e5e6e2e29dc1f26df19a54aaac76aac6b48b7353b1cab9b7ebe5ef475bfd73d5"},"schema_version":"1.0"},"canonical_sha256":"0dd77b53932a47edf51a5c26ac7e8bcf0960fbc877e123bd98e9ac10f6650854","source":{"kind":"arxiv","id":"2604.15261","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.15261","created_at":"2026-05-22T01:04:02Z"},{"alias_kind":"arxiv_version","alias_value":"2604.15261v3","created_at":"2026-05-22T01:04:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.15261","created_at":"2026-05-22T01:04:02Z"},{"alias_kind":"pith_short_12","alias_value":"BXLXWU4TFJD6","created_at":"2026-05-22T01:04:02Z"},{"alias_kind":"pith_short_16","alias_value":"BXLXWU4TFJD635I2","created_at":"2026-05-22T01:04:02Z"},{"alias_kind":"pith_short_8","alias_value":"BXLXWU4T","created_at":"2026-05-22T01:04:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:BXLXWU4TFJD635I2LQTKY7ULZ4","target":"record","payload":{"canonical_record":{"source":{"id":"2604.15261","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-04-16T17:37:04Z","cross_cats_sorted":[],"title_canon_sha256":"7461b5b1f73b173b8858830f5466e6df098b1feaa07ed7e7ef833beb6168c207","abstract_canon_sha256":"e5e6e2e29dc1f26df19a54aaac76aac6b48b7353b1cab9b7ebe5ef475bfd73d5"},"schema_version":"1.0"},"canonical_sha256":"0dd77b53932a47edf51a5c26ac7e8bcf0960fbc877e123bd98e9ac10f6650854","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:02.470735Z","signature_b64":"UDUwzyGPA2+lBBraUS+TwhEne0+I+t8bOUHyZ1vSw+GToZkuJjLSDUf83pzuT5ZZurC2xJFOgOjO90JTI3aOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dd77b53932a47edf51a5c26ac7e8bcf0960fbc877e123bd98e9ac10f6650854","last_reissued_at":"2026-05-22T01:04:02.470188Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:02.470188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.15261","source_version":3,"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-05-22T01:04:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sFcICpRtnig3IToXeOiClDpBWEGhR13PYrsJoaJ/KBtHs+gBK7rn8YT10LbAt6aQSPAzGlxqJrrVLK1Yx8TTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:05:29.134402Z"},"content_sha256":"c56276333e07bdf8c017a2fc66b956a2bb21d50e7e26ea4f71f60fc46c543c58","schema_version":"1.0","event_id":"sha256:c56276333e07bdf8c017a2fc66b956a2bb21d50e7e26ea4f71f60fc46c543c58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:BXLXWU4TFJD635I2LQTKY7ULZ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RNG: Flat Datacenter Networks at Scale","license":"http://creativecommons.org/licenses/by/4.0/","headline":"RNG builds flat datacenter networks from quasi-random graphs that match fat-tree performance at up to 45 percent lower cost.","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chinchu Merine Joseph, C. Seshadhri, Elizabeth Tennent, Enrico Carlesso, Giacomo Bernardi, Luiza Popa, Pavan Manikonda, Randy Ram, Ratul Mahajan, Saurabh Kumar, Steven Robinson","submitted_at":"2026-04-16T17:37:04Z","abstract_excerpt":"We design and deploy in production the first flat datacenter networks. Our design, called RNG, is based on quasi-random graphs. While the cost and fault-tolerance benefits of such topologies have been long known, their practical realization has been hampered by a lack of scalable routing and cabling approaches. RNG has a new distributed routing protocol that exploits the properties of random graphs to find a large number of edge disjoint paths between pairs of endpoints. It uses a novel passive optical device that internally shuffles cables, which makes its cabling complexity similar to that o"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"RNG matches or exceeds the performance of fat trees for a range of traffic patterns, despite being up to 45% cheaper. RNG is now the default datacenter network for most workloads at Amazon.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The quasi-random graph topology combined with the new distributed routing protocol can consistently locate a large number of edge-disjoint paths at production scale, and the passive optical shuffling device introduces no new reliability or performance penalties in real deployments.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"RNG is the first flat datacenter network deployed in production, based on quasi-random graphs with a scalable routing protocol and optical shuffling device, matching fat tree performance at up to 45% lower cost and now default at Amazon for most workloads.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"RNG builds flat datacenter networks from quasi-random graphs that match fat-tree performance at up to 45 percent lower cost.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"affd833e39fd2bcac0008fcdb11b3c56e16d5ce72872aac2b32be16a0e63ab2d"},"source":{"id":"2604.15261","kind":"arxiv","version":3},"verdict":{"id":"59126f7a-d59a-4489-8c36-13419a003b6e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-11T00:55:43.218946Z","strongest_claim":"RNG matches or exceeds the performance of fat trees for a range of traffic patterns, despite being up to 45% cheaper. RNG is now the default datacenter network for most workloads at Amazon.","one_line_summary":"RNG is the first flat datacenter network deployed in production, based on quasi-random graphs with a scalable routing protocol and optical shuffling device, matching fat tree performance at up to 45% lower cost and now default at Amazon for most workloads.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The quasi-random graph topology combined with the new distributed routing protocol can consistently locate a large number of edge-disjoint paths at production scale, and the passive optical shuffling device introduces no new reliability or performance penalties in real deployments.","pith_extraction_headline":"RNG builds flat datacenter networks from quasi-random graphs that match fat-tree performance at up to 45 percent lower cost."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.15261/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":2,"snapshot_sha256":"cf5a0b46892c86cd23461aff16bdbf8c823aea124e45d420c9dae9b43b1dffa0"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"59126f7a-d59a-4489-8c36-13419a003b6e"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-22T01:04:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zith0Pi4goWJAtsyX4Hvw44bH8SH9mCI5hByjiZICU/iM3SRfOPfmSaL2AHG0HtRBWiuiam6/em7CRmvWCLTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:05:29.134924Z"},"content_sha256":"582889fdbfe9dbf6000c2059485a087c34dd93102c6461ab3d0b8b400e2cf358","schema_version":"1.0","event_id":"sha256:582889fdbfe9dbf6000c2059485a087c34dd93102c6461ab3d0b8b400e2cf358"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BXLXWU4TFJD635I2LQTKY7ULZ4/bundle.json","state_url":"https://pith.science/pith/BXLXWU4TFJD635I2LQTKY7ULZ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BXLXWU4TFJD635I2LQTKY7ULZ4/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-05-28T05:05:29Z","links":{"resolver":"https://pith.science/pith/BXLXWU4TFJD635I2LQTKY7ULZ4","bundle":"https://pith.science/pith/BXLXWU4TFJD635I2LQTKY7ULZ4/bundle.json","state":"https://pith.science/pith/BXLXWU4TFJD635I2LQTKY7ULZ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BXLXWU4TFJD635I2LQTKY7ULZ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BXLXWU4TFJD635I2LQTKY7ULZ4","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":"e5e6e2e29dc1f26df19a54aaac76aac6b48b7353b1cab9b7ebe5ef475bfd73d5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-04-16T17:37:04Z","title_canon_sha256":"7461b5b1f73b173b8858830f5466e6df098b1feaa07ed7e7ef833beb6168c207"},"schema_version":"1.0","source":{"id":"2604.15261","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.15261","created_at":"2026-05-22T01:04:02Z"},{"alias_kind":"arxiv_version","alias_value":"2604.15261v3","created_at":"2026-05-22T01:04:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.15261","created_at":"2026-05-22T01:04:02Z"},{"alias_kind":"pith_short_12","alias_value":"BXLXWU4TFJD6","created_at":"2026-05-22T01:04:02Z"},{"alias_kind":"pith_short_16","alias_value":"BXLXWU4TFJD635I2","created_at":"2026-05-22T01:04:02Z"},{"alias_kind":"pith_short_8","alias_value":"BXLXWU4T","created_at":"2026-05-22T01:04:02Z"}],"graph_snapshots":[{"event_id":"sha256:582889fdbfe9dbf6000c2059485a087c34dd93102c6461ab3d0b8b400e2cf358","target":"graph","created_at":"2026-05-22T01:04:02Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"RNG matches or exceeds the performance of fat trees for a range of traffic patterns, despite being up to 45% cheaper. RNG is now the default datacenter network for most workloads at Amazon."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The quasi-random graph topology combined with the new distributed routing protocol can consistently locate a large number of edge-disjoint paths at production scale, and the passive optical shuffling device introduces no new reliability or performance penalties in real deployments."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"RNG is the first flat datacenter network deployed in production, based on quasi-random graphs with a scalable routing protocol and optical shuffling device, matching fat tree performance at up to 45% lower cost and now default at Amazon for most workloads."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"RNG builds flat datacenter networks from quasi-random graphs that match fat-tree performance at up to 45 percent lower cost."}],"snapshot_sha256":"affd833e39fd2bcac0008fcdb11b3c56e16d5ce72872aac2b32be16a0e63ab2d"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"cf5a0b46892c86cd23461aff16bdbf8c823aea124e45d420c9dae9b43b1dffa0"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.15261/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We design and deploy in production the first flat datacenter networks. Our design, called RNG, is based on quasi-random graphs. While the cost and fault-tolerance benefits of such topologies have been long known, their practical realization has been hampered by a lack of scalable routing and cabling approaches. RNG has a new distributed routing protocol that exploits the properties of random graphs to find a large number of edge disjoint paths between pairs of endpoints. It uses a novel passive optical device that internally shuffles cables, which makes its cabling complexity similar to that o","authors_text":"Chinchu Merine Joseph, C. Seshadhri, Elizabeth Tennent, Enrico Carlesso, Giacomo Bernardi, Luiza Popa, Pavan Manikonda, Randy Ram, Ratul Mahajan, Saurabh Kumar, Steven Robinson","cross_cats":[],"headline":"RNG builds flat datacenter networks from quasi-random graphs that match fat-tree performance at up to 45 percent lower cost.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-04-16T17:37:04Z","title":"RNG: Flat Datacenter Networks at Scale"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.15261","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-11T00:55:43.218946Z","id":"59126f7a-d59a-4489-8c36-13419a003b6e","model_set":{"reader":"grok-4.3"},"one_line_summary":"RNG is the first flat datacenter network deployed in production, based on quasi-random graphs with a scalable routing protocol and optical shuffling device, matching fat tree performance at up to 45% lower cost and now default at Amazon for most workloads.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"RNG builds flat datacenter networks from quasi-random graphs that match fat-tree performance at up to 45 percent lower cost.","strongest_claim":"RNG matches or exceeds the performance of fat trees for a range of traffic patterns, despite being up to 45% cheaper. RNG is now the default datacenter network for most workloads at Amazon.","weakest_assumption":"The quasi-random graph topology combined with the new distributed routing protocol can consistently locate a large number of edge-disjoint paths at production scale, and the passive optical shuffling device introduces no new reliability or performance penalties in real deployments."}},"verdict_id":"59126f7a-d59a-4489-8c36-13419a003b6e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c56276333e07bdf8c017a2fc66b956a2bb21d50e7e26ea4f71f60fc46c543c58","target":"record","created_at":"2026-05-22T01:04:02Z","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":"e5e6e2e29dc1f26df19a54aaac76aac6b48b7353b1cab9b7ebe5ef475bfd73d5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-04-16T17:37:04Z","title_canon_sha256":"7461b5b1f73b173b8858830f5466e6df098b1feaa07ed7e7ef833beb6168c207"},"schema_version":"1.0","source":{"id":"2604.15261","kind":"arxiv","version":3}},"canonical_sha256":"0dd77b53932a47edf51a5c26ac7e8bcf0960fbc877e123bd98e9ac10f6650854","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0dd77b53932a47edf51a5c26ac7e8bcf0960fbc877e123bd98e9ac10f6650854","first_computed_at":"2026-05-22T01:04:02.470188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:04:02.470188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UDUwzyGPA2+lBBraUS+TwhEne0+I+t8bOUHyZ1vSw+GToZkuJjLSDUf83pzuT5ZZurC2xJFOgOjO90JTI3aOAw==","signature_status":"signed_v1","signed_at":"2026-05-22T01:04:02.470735Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.15261","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c56276333e07bdf8c017a2fc66b956a2bb21d50e7e26ea4f71f60fc46c543c58","sha256:582889fdbfe9dbf6000c2059485a087c34dd93102c6461ab3d0b8b400e2cf358"],"state_sha256":"cfb7d9b6b124c13218edc29ddde47322b4ace0f5c05324ef4fb5f7d311e140e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AhF4rjNT2zMLmKn0zGM/M+U3NC1H25dX7creeOoVhdhHNtXNjzZKLfyUvTtQ9m9FApxHUXNazO17ONsIoSr/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:05:29.137341Z","bundle_sha256":"0ce67184705e4049788f4adade2911072530c3779d90d8cf594919eb44b7700d"}}