{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JKJXLQEUYX36AQYY7XRINA4JKK","short_pith_number":"pith:JKJXLQEU","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"},"canonical_sha256":"4a9375c094c5f7e04318fde2868389528b1d682ac37dbc81b51c413f73aae061","source":{"kind":"arxiv","id":"1509.01746","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01746","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01746v3","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01746","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"JKJXLQEUYX36","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JKJXLQEUYX36AQYY","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JKJXLQEU","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JKJXLQEUYX36AQYY7XRINA4JKK","target":"record","payload":{"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"},"canonical_sha256":"4a9375c094c5f7e04318fde2868389528b1d682ac37dbc81b51c413f73aae061","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"},"source_kind":"arxiv","source_id":"1509.01746","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-18T01:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0nKxXfl4pY9O3i/MlHzn7trLxvNp+xSmFGp+ViGaiHhY3O0IaZ5dycnvUQF3wvSXCeA6EkjzPPmcEPAHhlz9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:18:33.657987Z"},"content_sha256":"1960f96aef817fcb623e59d2a2999b6c5131079b05f830c65aaf04e12f8954d5","schema_version":"1.0","event_id":"sha256:1960f96aef817fcb623e59d2a2999b6c5131079b05f830c65aaf04e12f8954d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JKJXLQEUYX36AQYY7XRINA4JKK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"snAbHlzQpkzqaYalQx08+qZ0OHf3E3RqSFDZahZuk7fFDeoi7XXDDRXntahbjBsJ+CdJOmYJxOE6sbSyF9T1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:18:33.658341Z"},"content_sha256":"6eda7e9d8ac798b023de4478c4659eb3bcaeafafcb5e6ecfa48f9748bf4c444e","schema_version":"1.0","event_id":"sha256:6eda7e9d8ac798b023de4478c4659eb3bcaeafafcb5e6ecfa48f9748bf4c444e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKJXLQEUYX36AQYY7XRINA4JKK/bundle.json","state_url":"https://pith.science/pith/JKJXLQEUYX36AQYY7XRINA4JKK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKJXLQEUYX36AQYY7XRINA4JKK/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-06-26T15:18:33Z","links":{"resolver":"https://pith.science/pith/JKJXLQEUYX36AQYY7XRINA4JKK","bundle":"https://pith.science/pith/JKJXLQEUYX36AQYY7XRINA4JKK/bundle.json","state":"https://pith.science/pith/JKJXLQEUYX36AQYY7XRINA4JKK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKJXLQEUYX36AQYY7XRINA4JKK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JKJXLQEUYX36AQYY7XRINA4JKK","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":"9dee2f2a6018b4cd87b9977a4069a75a3da364f025bc328049c5b24d3823eaee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-05T22:35:46Z","title_canon_sha256":"8149f895862a0238584d201edf1b375a9c369192b55f8a41e17380da20b5804b"},"schema_version":"1.0","source":{"id":"1509.01746","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01746","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01746v3","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01746","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"JKJXLQEUYX36","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JKJXLQEUYX36AQYY","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JKJXLQEU","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:6eda7e9d8ac798b023de4478c4659eb3bcaeafafcb5e6ecfa48f9748bf4c444e","target":"graph","created_at":"2026-05-18T01:10:59Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Abbas Eslami Kiasari, Alejandro Erickson, Iain A. Stewart, Javier Navaridas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-05T22:35:46Z","title":"An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01746","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1960f96aef817fcb623e59d2a2999b6c5131079b05f830c65aaf04e12f8954d5","target":"record","created_at":"2026-05-18T01:10:59Z","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":"9dee2f2a6018b4cd87b9977a4069a75a3da364f025bc328049c5b24d3823eaee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-05T22:35:46Z","title_canon_sha256":"8149f895862a0238584d201edf1b375a9c369192b55f8a41e17380da20b5804b"},"schema_version":"1.0","source":{"id":"1509.01746","kind":"arxiv","version":3}},"canonical_sha256":"4a9375c094c5f7e04318fde2868389528b1d682ac37dbc81b51c413f73aae061","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a9375c094c5f7e04318fde2868389528b1d682ac37dbc81b51c413f73aae061","first_computed_at":"2026-05-18T01:10:59.887485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:59.887485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t8BYRY2PsYxJILJ7TlyN0rDFwIydbm/GiwAyCa4G5THkbiWOLUp//gxu1pDLl0WpVLrhg06gFAxIuflMcfVPDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:59.888004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.01746","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1960f96aef817fcb623e59d2a2999b6c5131079b05f830c65aaf04e12f8954d5","sha256:6eda7e9d8ac798b023de4478c4659eb3bcaeafafcb5e6ecfa48f9748bf4c444e"],"state_sha256":"fe526e764a8264ab503b59594f0a5644a791c347c53e3dc2994fe5f4a257614f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+SBtYXoS1zrEiY+H8C1ky2Wr399+O7AdgO8rdGMMHk37O57dIcmji0QTp9aRjpzJ+Sa/EBv7/zCYMNXk11ilDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T15:18:33.660242Z","bundle_sha256":"4060cb37db7fd90e0e15d9586708049c11e50a0222f2aa7cf626ed8d3e3a6f38"}}