{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IXM6VKB3MRXOAQWAW4CIYN6TPN","short_pith_number":"pith:IXM6VKB3","schema_version":"1.0","canonical_sha256":"45d9eaa83b646ee042c0b7048c37d37b71b723262fd4d3964b4113e1949b9574","source":{"kind":"arxiv","id":"1605.00863","version":1},"attestation_state":"computed","paper":{"title":"On the Mathematics of Data Centre Network Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Iain A. Stewart","submitted_at":"2016-05-03T12:21:07Z","abstract_excerpt":"The theory of combinatorial designs has recently been used in order to build switch-centric data centre networks incorporating a large number of servers, in comparison with the popular Fat-Tree data centre network. The construction employed, called the 3-step method, revolves around an appropriately chosen (but relatively small) bipartite graph and a transversal design. In this paper, we clarify and extend these recent results. In particular, we prove the following path diversity results: in a one-to-one context, we prove that in these data centre networks there are pairwise link-disjoint path"},"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":"1605.00863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-05-03T12:21:07Z","cross_cats_sorted":[],"title_canon_sha256":"5aeaaf1af04a0ffc6542298811f6298aeb39f3d4cc04697883a79f4bafddcdcc","abstract_canon_sha256":"0efd31d44c1d5144c92883b7e66da97cbf475812e0ae7f240f933bf0fc3da5f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:47.818696Z","signature_b64":"PfExzEdZbHqHkwWvez6reAKzAgn3lIu1ktPunx0YtrPCZ9yPJz4X0OiYsB4A/M5FdDe4PAIYO4FjDeYaH1VqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45d9eaa83b646ee042c0b7048c37d37b71b723262fd4d3964b4113e1949b9574","last_reissued_at":"2026-05-18T01:15:47.817997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:47.817997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Mathematics of Data Centre Network Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Iain A. Stewart","submitted_at":"2016-05-03T12:21:07Z","abstract_excerpt":"The theory of combinatorial designs has recently been used in order to build switch-centric data centre networks incorporating a large number of servers, in comparison with the popular Fat-Tree data centre network. The construction employed, called the 3-step method, revolves around an appropriately chosen (but relatively small) bipartite graph and a transversal design. In this paper, we clarify and extend these recent results. In particular, we prove the following path diversity results: in a one-to-one context, we prove that in these data centre networks there are pairwise link-disjoint path"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00863","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":""},"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":"1605.00863","created_at":"2026-05-18T01:15:47.818118+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.00863v1","created_at":"2026-05-18T01:15:47.818118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00863","created_at":"2026-05-18T01:15:47.818118+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXM6VKB3MRXO","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXM6VKB3MRXOAQWA","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXM6VKB3","created_at":"2026-05-18T12:30:22.444734+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/IXM6VKB3MRXOAQWAW4CIYN6TPN","json":"https://pith.science/pith/IXM6VKB3MRXOAQWAW4CIYN6TPN.json","graph_json":"https://pith.science/api/pith-number/IXM6VKB3MRXOAQWAW4CIYN6TPN/graph.json","events_json":"https://pith.science/api/pith-number/IXM6VKB3MRXOAQWAW4CIYN6TPN/events.json","paper":"https://pith.science/paper/IXM6VKB3"},"agent_actions":{"view_html":"https://pith.science/pith/IXM6VKB3MRXOAQWAW4CIYN6TPN","download_json":"https://pith.science/pith/IXM6VKB3MRXOAQWAW4CIYN6TPN.json","view_paper":"https://pith.science/paper/IXM6VKB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.00863&json=true","fetch_graph":"https://pith.science/api/pith-number/IXM6VKB3MRXOAQWAW4CIYN6TPN/graph.json","fetch_events":"https://pith.science/api/pith-number/IXM6VKB3MRXOAQWAW4CIYN6TPN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXM6VKB3MRXOAQWAW4CIYN6TPN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXM6VKB3MRXOAQWAW4CIYN6TPN/action/storage_attestation","attest_author":"https://pith.science/pith/IXM6VKB3MRXOAQWAW4CIYN6TPN/action/author_attestation","sign_citation":"https://pith.science/pith/IXM6VKB3MRXOAQWAW4CIYN6TPN/action/citation_signature","submit_replication":"https://pith.science/pith/IXM6VKB3MRXOAQWAW4CIYN6TPN/action/replication_record"}},"created_at":"2026-05-18T01:15:47.818118+00:00","updated_at":"2026-05-18T01:15:47.818118+00:00"}