{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IT2QMY5A7T3CDWPURGD6KOIMGA","short_pith_number":"pith:IT2QMY5A","canonical_record":{"source":{"id":"1705.06024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-17T06:44:58Z","cross_cats_sorted":[],"title_canon_sha256":"3d9c7380c8d2cf6530b2c2cc407c9aa4f36205752e1aaab3f2b329b14adec567","abstract_canon_sha256":"80cc442a9ea4e73c2f1db10a1f1e1e87291c45eea96e25e0122995cc9a4d1f62"},"schema_version":"1.0"},"canonical_sha256":"44f50663a0fcf621d9f48987e5390c3018c12f3612090eb7a8c52db738c7c1f8","source":{"kind":"arxiv","id":"1705.06024","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06024","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06024v1","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06024","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"pith_short_12","alias_value":"IT2QMY5A7T3C","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IT2QMY5A7T3CDWPU","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IT2QMY5A","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IT2QMY5A7T3CDWPURGD6KOIMGA","target":"record","payload":{"canonical_record":{"source":{"id":"1705.06024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-17T06:44:58Z","cross_cats_sorted":[],"title_canon_sha256":"3d9c7380c8d2cf6530b2c2cc407c9aa4f36205752e1aaab3f2b329b14adec567","abstract_canon_sha256":"80cc442a9ea4e73c2f1db10a1f1e1e87291c45eea96e25e0122995cc9a4d1f62"},"schema_version":"1.0"},"canonical_sha256":"44f50663a0fcf621d9f48987e5390c3018c12f3612090eb7a8c52db738c7c1f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:19.171258Z","signature_b64":"GNP2YxAFN5x6h1Rv3LqnrSqnSAlXmAdK+H/pl+a5B7fZQFHYIimcwYfzOehA6ZP7DskIyjArLWTNSgvjU5hfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44f50663a0fcf621d9f48987e5390c3018c12f3612090eb7a8c52db738c7c1f8","last_reissued_at":"2026-05-18T00:44:19.170695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:19.170695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.06024","source_version":1,"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-18T00:44:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aXjx7VgFvsdC+73zERtEKCjEoC/EJ0sYGhwZgXslrSZ5eix3rsDauZxQ9LLCMXy3rQIm3VSmJoLwfppA57TTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:48:10.218946Z"},"content_sha256":"1c058f209ddd2788470ff49eb28515ce2b1c02e923732be325a36cfd5d2e02ef","schema_version":"1.0","event_id":"sha256:1c058f209ddd2788470ff49eb28515ce2b1c02e923732be325a36cfd5d2e02ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IT2QMY5A7T3CDWPURGD6KOIMGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Demand-Aware Network Designs of Bounded Degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chen Avin, Kaushik Mondal, Stefan Schmid","submitted_at":"2017-05-17T06:44:58Z","abstract_excerpt":"Traditionally, networks such as datacenter interconnects are designed to optimize worst-case performance under arbitrary traffic patterns. Such network designs can however be far from optimal when considering the actual workloads and traffic patterns which they serve. This insight led to the development of demand-aware datacenter interconnects which can be reconfigured depending on the workload.\n  Motivated by these trends, this paper initiates the algorithmic study of demand-aware networks (DANs) designs, and in particular the design of bounded-degree networks. The inputs to the network desig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06024","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"},"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-18T00:44:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"koL9K7IrtiYpZ5bcSm6YunqfOiuYLF4yN2F8ZwSlAryWv1jTRh7TITKAqBdlegbdfCWukkcaBkWjUMU25gV9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:48:10.219471Z"},"content_sha256":"c3a33cf8ef16cbe15311f2902522781c77a9c51b18f3bd160757b9035ac28def","schema_version":"1.0","event_id":"sha256:c3a33cf8ef16cbe15311f2902522781c77a9c51b18f3bd160757b9035ac28def"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IT2QMY5A7T3CDWPURGD6KOIMGA/bundle.json","state_url":"https://pith.science/pith/IT2QMY5A7T3CDWPURGD6KOIMGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IT2QMY5A7T3CDWPURGD6KOIMGA/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-05-31T20:48:10Z","links":{"resolver":"https://pith.science/pith/IT2QMY5A7T3CDWPURGD6KOIMGA","bundle":"https://pith.science/pith/IT2QMY5A7T3CDWPURGD6KOIMGA/bundle.json","state":"https://pith.science/pith/IT2QMY5A7T3CDWPURGD6KOIMGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IT2QMY5A7T3CDWPURGD6KOIMGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IT2QMY5A7T3CDWPURGD6KOIMGA","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":"80cc442a9ea4e73c2f1db10a1f1e1e87291c45eea96e25e0122995cc9a4d1f62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-17T06:44:58Z","title_canon_sha256":"3d9c7380c8d2cf6530b2c2cc407c9aa4f36205752e1aaab3f2b329b14adec567"},"schema_version":"1.0","source":{"id":"1705.06024","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06024","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06024v1","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06024","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"pith_short_12","alias_value":"IT2QMY5A7T3C","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IT2QMY5A7T3CDWPU","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IT2QMY5A","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:c3a33cf8ef16cbe15311f2902522781c77a9c51b18f3bd160757b9035ac28def","target":"graph","created_at":"2026-05-18T00:44:19Z","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":"Traditionally, networks such as datacenter interconnects are designed to optimize worst-case performance under arbitrary traffic patterns. Such network designs can however be far from optimal when considering the actual workloads and traffic patterns which they serve. This insight led to the development of demand-aware datacenter interconnects which can be reconfigured depending on the workload.\n  Motivated by these trends, this paper initiates the algorithmic study of demand-aware networks (DANs) designs, and in particular the design of bounded-degree networks. The inputs to the network desig","authors_text":"Chen Avin, Kaushik Mondal, Stefan Schmid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-17T06:44:58Z","title":"Demand-Aware Network Designs of Bounded Degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06024","kind":"arxiv","version":1},"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:1c058f209ddd2788470ff49eb28515ce2b1c02e923732be325a36cfd5d2e02ef","target":"record","created_at":"2026-05-18T00:44:19Z","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":"80cc442a9ea4e73c2f1db10a1f1e1e87291c45eea96e25e0122995cc9a4d1f62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-17T06:44:58Z","title_canon_sha256":"3d9c7380c8d2cf6530b2c2cc407c9aa4f36205752e1aaab3f2b329b14adec567"},"schema_version":"1.0","source":{"id":"1705.06024","kind":"arxiv","version":1}},"canonical_sha256":"44f50663a0fcf621d9f48987e5390c3018c12f3612090eb7a8c52db738c7c1f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44f50663a0fcf621d9f48987e5390c3018c12f3612090eb7a8c52db738c7c1f8","first_computed_at":"2026-05-18T00:44:19.170695Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:19.170695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GNP2YxAFN5x6h1Rv3LqnrSqnSAlXmAdK+H/pl+a5B7fZQFHYIimcwYfzOehA6ZP7DskIyjArLWTNSgvjU5hfBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:19.171258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.06024","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c058f209ddd2788470ff49eb28515ce2b1c02e923732be325a36cfd5d2e02ef","sha256:c3a33cf8ef16cbe15311f2902522781c77a9c51b18f3bd160757b9035ac28def"],"state_sha256":"0ab3b75b65ca3a09fc1e9d50d81c274c33c3fd51a104c9a86ce2098e4c275a1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K+5xe0V5XxLUu39hCw94e0G8NZTZv/QsmUH81bveu2C1WQQY4C4DPsuT6ma9Fjk+wQ0CVAYxdwuz75UdibIvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:48:10.224978Z","bundle_sha256":"2b4320c6cd6d6ec33d07a83e3f474f2cf8f61f51ad871f065dba827dc85cd01c"}}