{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JKJXLQEUYX36AQYY7XRINA4JKK","short_pith_number":"pith:JKJXLQEU","schema_version":"1.0","canonical_sha256":"4a9375c094c5f7e04318fde2868389528b1d682ac37dbc81b51c413f73aae061","source":{"kind":"arxiv","id":"1509.01746","version":3},"attestation_state":"computed","paper":{"title":"An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Abbas Eslami Kiasari, Alejandro Erickson, Iain A. Stewart, Javier Navaridas","submitted_at":"2015-09-05T22:35:46Z","abstract_excerpt":"DPillar has recently been proposed as a server-centric datacenter network and is combinatorially related to (but distinct from) the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network before proving that the underlying graph of DPillar is a Cayley graph; hence, the datacenter network DPillar is node-symmetric. We use this symmetry property to establish a single-path routing algorithm for DPillar that computes a shortest path and has time complexity $O(k)$, where $k$ parameterizes the dimension of DPillar (we refer to the number of"},"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":"1509.01746","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-05T22:35:46Z","cross_cats_sorted":[],"title_canon_sha256":"8149f895862a0238584d201edf1b375a9c369192b55f8a41e17380da20b5804b","abstract_canon_sha256":"9dee2f2a6018b4cd87b9977a4069a75a3da364f025bc328049c5b24d3823eaee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:59.888004Z","signature_b64":"t8BYRY2PsYxJILJ7TlyN0rDFwIydbm/GiwAyCa4G5THkbiWOLUp//gxu1pDLl0WpVLrhg06gFAxIuflMcfVPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a9375c094c5f7e04318fde2868389528b1d682ac37dbc81b51c413f73aae061","last_reissued_at":"2026-05-18T01:10:59.887485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:59.887485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Abbas Eslami Kiasari, Alejandro Erickson, Iain A. Stewart, Javier Navaridas","submitted_at":"2015-09-05T22:35:46Z","abstract_excerpt":"DPillar has recently been proposed as a server-centric datacenter network and is combinatorially related to (but distinct from) the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network before proving that the underlying graph of DPillar is a Cayley graph; hence, the datacenter network DPillar is node-symmetric. We use this symmetry property to establish a single-path routing algorithm for DPillar that computes a shortest path and has time complexity $O(k)$, where $k$ parameterizes the dimension of DPillar (we refer to the number of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01746","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":"1509.01746","created_at":"2026-05-18T01:10:59.887555+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.01746v3","created_at":"2026-05-18T01:10:59.887555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01746","created_at":"2026-05-18T01:10:59.887555+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKJXLQEUYX36","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKJXLQEUYX36AQYY","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKJXLQEU","created_at":"2026-05-18T12:29:27.538025+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/JKJXLQEUYX36AQYY7XRINA4JKK","json":"https://pith.science/pith/JKJXLQEUYX36AQYY7XRINA4JKK.json","graph_json":"https://pith.science/api/pith-number/JKJXLQEUYX36AQYY7XRINA4JKK/graph.json","events_json":"https://pith.science/api/pith-number/JKJXLQEUYX36AQYY7XRINA4JKK/events.json","paper":"https://pith.science/paper/JKJXLQEU"},"agent_actions":{"view_html":"https://pith.science/pith/JKJXLQEUYX36AQYY7XRINA4JKK","download_json":"https://pith.science/pith/JKJXLQEUYX36AQYY7XRINA4JKK.json","view_paper":"https://pith.science/paper/JKJXLQEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.01746&json=true","fetch_graph":"https://pith.science/api/pith-number/JKJXLQEUYX36AQYY7XRINA4JKK/graph.json","fetch_events":"https://pith.science/api/pith-number/JKJXLQEUYX36AQYY7XRINA4JKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKJXLQEUYX36AQYY7XRINA4JKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKJXLQEUYX36AQYY7XRINA4JKK/action/storage_attestation","attest_author":"https://pith.science/pith/JKJXLQEUYX36AQYY7XRINA4JKK/action/author_attestation","sign_citation":"https://pith.science/pith/JKJXLQEUYX36AQYY7XRINA4JKK/action/citation_signature","submit_replication":"https://pith.science/pith/JKJXLQEUYX36AQYY7XRINA4JKK/action/replication_record"}},"created_at":"2026-05-18T01:10:59.887555+00:00","updated_at":"2026-05-18T01:10:59.887555+00:00"}