{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LLI3JNMNREYSB2NR7CUVUJIDGQ","short_pith_number":"pith:LLI3JNMN","schema_version":"1.0","canonical_sha256":"5ad1b4b58d893120e9b1f8a95a2503341853e1330d5fcb9569bcbcb2e3c82201","source":{"kind":"arxiv","id":"1110.1687","version":3},"attestation_state":"computed","paper":{"title":"Jellyfish: Networking Data Centers Randomly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ankit Singla, Chi-Yao Hong, Lucian Popa, P. Brighten Godfrey","submitted_at":"2011-10-08T01:24:57Z","abstract_excerpt":"Industry experience indicates that the ability to incrementally expand data centers is essential. However, existing high-bandwidth network designs have rigid structure that interferes with incremental expansion. We present Jellyfish, a high-capacity network interconnect, which, by adopting a random graph topology, yields itself naturally to incremental expansion. Somewhat surprisingly, Jellyfish is more cost-efficient than a fat-tree: A Jellyfish interconnect built using the same equipment as a fat-tree, supports as many as 25% more servers at full capacity at the scale of a few thousand nodes"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1110.1687","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-10-08T01:24:57Z","cross_cats_sorted":[],"title_canon_sha256":"7e5588ba636127ff83a208888ea34da2d4d68ff86fd1f366e2b5945011434e70","abstract_canon_sha256":"632700747b43625a7eebdfdac629077418053b326fef6ffd6373bbd811cee894"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:24.841578Z","signature_b64":"cRGuAzjijrhc5SjdOeHEBmrwWj96iDTtgS0/ZtXjrDnuILp/fzsJf75EXH05crw9wYETsrve5FYIU0iKGLm6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ad1b4b58d893120e9b1f8a95a2503341853e1330d5fcb9569bcbcb2e3c82201","last_reissued_at":"2026-05-18T03:57:24.840057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:24.840057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Jellyfish: Networking Data Centers Randomly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ankit Singla, Chi-Yao Hong, Lucian Popa, P. Brighten Godfrey","submitted_at":"2011-10-08T01:24:57Z","abstract_excerpt":"Industry experience indicates that the ability to incrementally expand data centers is essential. However, existing high-bandwidth network designs have rigid structure that interferes with incremental expansion. We present Jellyfish, a high-capacity network interconnect, which, by adopting a random graph topology, yields itself naturally to incremental expansion. Somewhat surprisingly, Jellyfish is more cost-efficient than a fat-tree: A Jellyfish interconnect built using the same equipment as a fat-tree, supports as many as 25% more servers at full capacity at the scale of a few thousand nodes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1687","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1110.1687","created_at":"2026-05-18T03:57:24.840651+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.1687v3","created_at":"2026-05-18T03:57:24.840651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1687","created_at":"2026-05-18T03:57:24.840651+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLI3JNMNREYS","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLI3JNMNREYSB2NR","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLI3JNMN","created_at":"2026-05-18T12:26:34.985390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LLI3JNMNREYSB2NR7CUVUJIDGQ","json":"https://pith.science/pith/LLI3JNMNREYSB2NR7CUVUJIDGQ.json","graph_json":"https://pith.science/api/pith-number/LLI3JNMNREYSB2NR7CUVUJIDGQ/graph.json","events_json":"https://pith.science/api/pith-number/LLI3JNMNREYSB2NR7CUVUJIDGQ/events.json","paper":"https://pith.science/paper/LLI3JNMN"},"agent_actions":{"view_html":"https://pith.science/pith/LLI3JNMNREYSB2NR7CUVUJIDGQ","download_json":"https://pith.science/pith/LLI3JNMNREYSB2NR7CUVUJIDGQ.json","view_paper":"https://pith.science/paper/LLI3JNMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.1687&json=true","fetch_graph":"https://pith.science/api/pith-number/LLI3JNMNREYSB2NR7CUVUJIDGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LLI3JNMNREYSB2NR7CUVUJIDGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLI3JNMNREYSB2NR7CUVUJIDGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLI3JNMNREYSB2NR7CUVUJIDGQ/action/storage_attestation","attest_author":"https://pith.science/pith/LLI3JNMNREYSB2NR7CUVUJIDGQ/action/author_attestation","sign_citation":"https://pith.science/pith/LLI3JNMNREYSB2NR7CUVUJIDGQ/action/citation_signature","submit_replication":"https://pith.science/pith/LLI3JNMNREYSB2NR7CUVUJIDGQ/action/replication_record"}},"created_at":"2026-05-18T03:57:24.840651+00:00","updated_at":"2026-05-18T03:57:24.840651+00:00"}