{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AEMQM2UXK6IBQHPC562AYMZBQU","short_pith_number":"pith:AEMQM2UX","schema_version":"1.0","canonical_sha256":"0119066a975790181de2efb40c3321853e5941dcde8e92c30f2c6b4d3cc4f077","source":{"kind":"arxiv","id":"1309.7066","version":2},"attestation_state":"computed","paper":{"title":"High Throughput Data Center Topology Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Alexandra Kolla, Ankit Singla, P. Brighten Godfrey","submitted_at":"2013-09-26T20:24:01Z","abstract_excerpt":"With high throughput networks acquiring a crucial role in supporting data-intensive applications, a variety of data center network topologies have been proposed to achieve high capacity at low cost. While this literature explores a large number of design points, even in the limited case of a network of identical switches, no proposal has been able to claim any notion of optimality. The case of heterogeneous networks, incorporating multiple line-speeds and port-counts as data centers grow over time, introduces even greater complexity.\n  In this paper, we present the first non-trivial upper-boun"},"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":"1309.7066","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-09-26T20:24:01Z","cross_cats_sorted":[],"title_canon_sha256":"ec68502e016642dbf297b3965921c7ef6451ef9de55e843250640bf1d72eabd3","abstract_canon_sha256":"79b2a70e64baab9ad230a927e20e15b79a9ff7c0db27624bd58a70b6e1f9ed68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:18.234086Z","signature_b64":"VQgbFN60m/S3or3wbu9lmHv1/sD5MK6BZkVS4jM2iGynvqu8Z1+D+KYBiggclHdE0pk0BMQoBO/YF2rViVqgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0119066a975790181de2efb40c3321853e5941dcde8e92c30f2c6b4d3cc4f077","last_reissued_at":"2026-05-18T02:59:18.233544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:18.233544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High Throughput Data Center Topology Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Alexandra Kolla, Ankit Singla, P. Brighten Godfrey","submitted_at":"2013-09-26T20:24:01Z","abstract_excerpt":"With high throughput networks acquiring a crucial role in supporting data-intensive applications, a variety of data center network topologies have been proposed to achieve high capacity at low cost. While this literature explores a large number of design points, even in the limited case of a network of identical switches, no proposal has been able to claim any notion of optimality. The case of heterogeneous networks, incorporating multiple line-speeds and port-counts as data centers grow over time, introduces even greater complexity.\n  In this paper, we present the first non-trivial upper-boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7066","kind":"arxiv","version":2},"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":"1309.7066","created_at":"2026-05-18T02:59:18.233622+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7066v2","created_at":"2026-05-18T02:59:18.233622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7066","created_at":"2026-05-18T02:59:18.233622+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEMQM2UXK6IB","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEMQM2UXK6IBQHPC","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEMQM2UX","created_at":"2026-05-18T12:27:38.830355+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/AEMQM2UXK6IBQHPC562AYMZBQU","json":"https://pith.science/pith/AEMQM2UXK6IBQHPC562AYMZBQU.json","graph_json":"https://pith.science/api/pith-number/AEMQM2UXK6IBQHPC562AYMZBQU/graph.json","events_json":"https://pith.science/api/pith-number/AEMQM2UXK6IBQHPC562AYMZBQU/events.json","paper":"https://pith.science/paper/AEMQM2UX"},"agent_actions":{"view_html":"https://pith.science/pith/AEMQM2UXK6IBQHPC562AYMZBQU","download_json":"https://pith.science/pith/AEMQM2UXK6IBQHPC562AYMZBQU.json","view_paper":"https://pith.science/paper/AEMQM2UX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7066&json=true","fetch_graph":"https://pith.science/api/pith-number/AEMQM2UXK6IBQHPC562AYMZBQU/graph.json","fetch_events":"https://pith.science/api/pith-number/AEMQM2UXK6IBQHPC562AYMZBQU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEMQM2UXK6IBQHPC562AYMZBQU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEMQM2UXK6IBQHPC562AYMZBQU/action/storage_attestation","attest_author":"https://pith.science/pith/AEMQM2UXK6IBQHPC562AYMZBQU/action/author_attestation","sign_citation":"https://pith.science/pith/AEMQM2UXK6IBQHPC562AYMZBQU/action/citation_signature","submit_replication":"https://pith.science/pith/AEMQM2UXK6IBQHPC562AYMZBQU/action/replication_record"}},"created_at":"2026-05-18T02:59:18.233622+00:00","updated_at":"2026-05-18T02:59:18.233622+00:00"}