{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7TFHU7VFTIHN2Y5V3KLRKEASZP","short_pith_number":"pith:7TFHU7VF","schema_version":"1.0","canonical_sha256":"fcca7a7ea59a0edd63b5da97151012cbf15b7f72ae68e167fd8a08d41393c545","source":{"kind":"arxiv","id":"1110.0196","version":3},"attestation_state":"computed","paper":{"title":"Self-Adjusting Networks to Minimize Expected Path Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Bernhard Haeupler, Chen Avin, Michael Borokhovich, Zvi Lotker","submitted_at":"2011-10-02T15:18:05Z","abstract_excerpt":"Given a network infrastructure (e.g., data-center or on-chip-network) and a distribution on the source-destination requests, the expected path (route) length is an important measure for the performance, efficiency and power consumption of the network. In this work we initiate a study on self-adjusting networks: networks that use local-distributed mechanisms to adjust the position of the nodes (e.g., virtual machines) in the network to best fit the route requests distribution. Finding the optimal placement of nodes is defined as the minimum expected path length (MEPL) problem. This is a general"},"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":"1110.0196","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-10-02T15:18:05Z","cross_cats_sorted":[],"title_canon_sha256":"3599d130ca291db53eeb1dfd9391eb57d65471e4e0ebed4432696294e28246d2","abstract_canon_sha256":"e9ddcd9ad43abc00d9e2304031f2b1dc2f85552e482cb899bce8854fb6f45952"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:47.270664Z","signature_b64":"dtM2v/hwJmeIcYVw0piBHhFugRMPjARj2GjFeb9zGC0LMhO2r0bosReKKUVJS/5rbBXzmqD6ylnrRFV8zS4HBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcca7a7ea59a0edd63b5da97151012cbf15b7f72ae68e167fd8a08d41393c545","last_reissued_at":"2026-05-18T03:51:47.270112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:47.270112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Adjusting Networks to Minimize Expected Path Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Bernhard Haeupler, Chen Avin, Michael Borokhovich, Zvi Lotker","submitted_at":"2011-10-02T15:18:05Z","abstract_excerpt":"Given a network infrastructure (e.g., data-center or on-chip-network) and a distribution on the source-destination requests, the expected path (route) length is an important measure for the performance, efficiency and power consumption of the network. In this work we initiate a study on self-adjusting networks: networks that use local-distributed mechanisms to adjust the position of the nodes (e.g., virtual machines) in the network to best fit the route requests distribution. Finding the optimal placement of nodes is defined as the minimum expected path length (MEPL) problem. This is a general"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0196","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":"1110.0196","created_at":"2026-05-18T03:51:47.270186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.0196v3","created_at":"2026-05-18T03:51:47.270186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0196","created_at":"2026-05-18T03:51:47.270186+00:00"},{"alias_kind":"pith_short_12","alias_value":"7TFHU7VFTIHN","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7TFHU7VFTIHN2Y5V","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7TFHU7VF","created_at":"2026-05-18T12:26:22.705136+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/7TFHU7VFTIHN2Y5V3KLRKEASZP","json":"https://pith.science/pith/7TFHU7VFTIHN2Y5V3KLRKEASZP.json","graph_json":"https://pith.science/api/pith-number/7TFHU7VFTIHN2Y5V3KLRKEASZP/graph.json","events_json":"https://pith.science/api/pith-number/7TFHU7VFTIHN2Y5V3KLRKEASZP/events.json","paper":"https://pith.science/paper/7TFHU7VF"},"agent_actions":{"view_html":"https://pith.science/pith/7TFHU7VFTIHN2Y5V3KLRKEASZP","download_json":"https://pith.science/pith/7TFHU7VFTIHN2Y5V3KLRKEASZP.json","view_paper":"https://pith.science/paper/7TFHU7VF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.0196&json=true","fetch_graph":"https://pith.science/api/pith-number/7TFHU7VFTIHN2Y5V3KLRKEASZP/graph.json","fetch_events":"https://pith.science/api/pith-number/7TFHU7VFTIHN2Y5V3KLRKEASZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7TFHU7VFTIHN2Y5V3KLRKEASZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7TFHU7VFTIHN2Y5V3KLRKEASZP/action/storage_attestation","attest_author":"https://pith.science/pith/7TFHU7VFTIHN2Y5V3KLRKEASZP/action/author_attestation","sign_citation":"https://pith.science/pith/7TFHU7VFTIHN2Y5V3KLRKEASZP/action/citation_signature","submit_replication":"https://pith.science/pith/7TFHU7VFTIHN2Y5V3KLRKEASZP/action/replication_record"}},"created_at":"2026-05-18T03:51:47.270186+00:00","updated_at":"2026-05-18T03:51:47.270186+00:00"}