{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MLUVZZZBNJPIE3PSV2WOCWPUJM","short_pith_number":"pith:MLUVZZZB","schema_version":"1.0","canonical_sha256":"62e95ce7216a5e826df2aeace159f44b3b3f969e6538f835b3121d2ffa7efbfd","source":{"kind":"arxiv","id":"1705.07163","version":1},"attestation_state":"computed","paper":{"title":"Towards Communication-Aware Robust Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Alexandr Hercules, Andreas Loukas, Chen Avin, Stefan Schmid","submitted_at":"2017-05-19T19:47:23Z","abstract_excerpt":"We currently witness the emergence of interesting new network topologies optimized towards the traffic matrices they serve, such as demand-aware datacenter interconnects (e.g., ProjecToR) and demand-aware overlay networks (e.g., SplayNets). This paper introduces a formal framework and approach to reason about and design such topologies. We leverage a connection between the communication frequency of two nodes and the path length between them in the network, which depends on the entropy of the communication matrix. Our main contribution is a novel robust, yet sparse, family of network topologie"},"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":"1705.07163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-05-19T19:47:23Z","cross_cats_sorted":[],"title_canon_sha256":"cda7b4e2eca2a639da4d32ab64fb74412d7b1e60b07cc43b80f337b2214b97dd","abstract_canon_sha256":"9f7689e91048866fc7b916a71444e480621a3930e41def3cc511f239bd10f205"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:06.411841Z","signature_b64":"od12RM5ag+f2ti3TVOltyAlVcbfycWbeDst5k6v/ttspy40FYde3MHgCsDHHDF/WZgR4EuvavEaVScjSFF9sDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62e95ce7216a5e826df2aeace159f44b3b3f969e6538f835b3121d2ffa7efbfd","last_reissued_at":"2026-05-18T00:44:06.411255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:06.411255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Communication-Aware Robust Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Alexandr Hercules, Andreas Loukas, Chen Avin, Stefan Schmid","submitted_at":"2017-05-19T19:47:23Z","abstract_excerpt":"We currently witness the emergence of interesting new network topologies optimized towards the traffic matrices they serve, such as demand-aware datacenter interconnects (e.g., ProjecToR) and demand-aware overlay networks (e.g., SplayNets). This paper introduces a formal framework and approach to reason about and design such topologies. We leverage a connection between the communication frequency of two nodes and the path length between them in the network, which depends on the entropy of the communication matrix. Our main contribution is a novel robust, yet sparse, family of network topologie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07163","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":"1705.07163","created_at":"2026-05-18T00:44:06.411349+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07163v1","created_at":"2026-05-18T00:44:06.411349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07163","created_at":"2026-05-18T00:44:06.411349+00:00"},{"alias_kind":"pith_short_12","alias_value":"MLUVZZZBNJPI","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MLUVZZZBNJPIE3PS","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MLUVZZZB","created_at":"2026-05-18T12:31:31.346846+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/MLUVZZZBNJPIE3PSV2WOCWPUJM","json":"https://pith.science/pith/MLUVZZZBNJPIE3PSV2WOCWPUJM.json","graph_json":"https://pith.science/api/pith-number/MLUVZZZBNJPIE3PSV2WOCWPUJM/graph.json","events_json":"https://pith.science/api/pith-number/MLUVZZZBNJPIE3PSV2WOCWPUJM/events.json","paper":"https://pith.science/paper/MLUVZZZB"},"agent_actions":{"view_html":"https://pith.science/pith/MLUVZZZBNJPIE3PSV2WOCWPUJM","download_json":"https://pith.science/pith/MLUVZZZBNJPIE3PSV2WOCWPUJM.json","view_paper":"https://pith.science/paper/MLUVZZZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07163&json=true","fetch_graph":"https://pith.science/api/pith-number/MLUVZZZBNJPIE3PSV2WOCWPUJM/graph.json","fetch_events":"https://pith.science/api/pith-number/MLUVZZZBNJPIE3PSV2WOCWPUJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MLUVZZZBNJPIE3PSV2WOCWPUJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MLUVZZZBNJPIE3PSV2WOCWPUJM/action/storage_attestation","attest_author":"https://pith.science/pith/MLUVZZZBNJPIE3PSV2WOCWPUJM/action/author_attestation","sign_citation":"https://pith.science/pith/MLUVZZZBNJPIE3PSV2WOCWPUJM/action/citation_signature","submit_replication":"https://pith.science/pith/MLUVZZZBNJPIE3PSV2WOCWPUJM/action/replication_record"}},"created_at":"2026-05-18T00:44:06.411349+00:00","updated_at":"2026-05-18T00:44:06.411349+00:00"}