{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7TFHU7VFTIHN2Y5V3KLRKEASZP","short_pith_number":"pith:7TFHU7VF","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"},"canonical_sha256":"fcca7a7ea59a0edd63b5da97151012cbf15b7f72ae68e167fd8a08d41393c545","source":{"kind":"arxiv","id":"1110.0196","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0196","created_at":"2026-05-18T03:51:47Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0196v3","created_at":"2026-05-18T03:51:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0196","created_at":"2026-05-18T03:51:47Z"},{"alias_kind":"pith_short_12","alias_value":"7TFHU7VFTIHN","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7TFHU7VFTIHN2Y5V","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7TFHU7VF","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7TFHU7VFTIHN2Y5V3KLRKEASZP","target":"record","payload":{"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"},"canonical_sha256":"fcca7a7ea59a0edd63b5da97151012cbf15b7f72ae68e167fd8a08d41393c545","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"},"source_kind":"arxiv","source_id":"1110.0196","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-18T03:51:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIfR56vxK2AvCe1Q/3Hqy7V7trhuqKtTRv7JWLMuAdFOlXeXO1HXpNBvtirryeNSHaXYcG6X06zUnZFI5B5kAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:26:26.563661Z"},"content_sha256":"15f1fb19be0c4de07742c8a9b5f28460126384f75226726293caf4cb3ee0b89f","schema_version":"1.0","event_id":"sha256:15f1fb19be0c4de07742c8a9b5f28460126384f75226726293caf4cb3ee0b89f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7TFHU7VFTIHN2Y5V3KLRKEASZP","target":"graph","payload":{"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"},"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-18T03:51:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xg4iLK7bMNLYgtq5GWRe8On1T7jeFZY//exI4M6iXAMJdCdu2IaqZw7s59OoBK8k00ZXpO9JcGRAtn1CzdZkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:26:26.564370Z"},"content_sha256":"5b0243963bbeab3a0bbb521c41687f8e65235cd9c313bbb4bccb6828690cf7f0","schema_version":"1.0","event_id":"sha256:5b0243963bbeab3a0bbb521c41687f8e65235cd9c313bbb4bccb6828690cf7f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7TFHU7VFTIHN2Y5V3KLRKEASZP/bundle.json","state_url":"https://pith.science/pith/7TFHU7VFTIHN2Y5V3KLRKEASZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7TFHU7VFTIHN2Y5V3KLRKEASZP/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-25T20:26:26Z","links":{"resolver":"https://pith.science/pith/7TFHU7VFTIHN2Y5V3KLRKEASZP","bundle":"https://pith.science/pith/7TFHU7VFTIHN2Y5V3KLRKEASZP/bundle.json","state":"https://pith.science/pith/7TFHU7VFTIHN2Y5V3KLRKEASZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7TFHU7VFTIHN2Y5V3KLRKEASZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7TFHU7VFTIHN2Y5V3KLRKEASZP","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":"e9ddcd9ad43abc00d9e2304031f2b1dc2f85552e482cb899bce8854fb6f45952","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-10-02T15:18:05Z","title_canon_sha256":"3599d130ca291db53eeb1dfd9391eb57d65471e4e0ebed4432696294e28246d2"},"schema_version":"1.0","source":{"id":"1110.0196","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0196","created_at":"2026-05-18T03:51:47Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0196v3","created_at":"2026-05-18T03:51:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0196","created_at":"2026-05-18T03:51:47Z"},{"alias_kind":"pith_short_12","alias_value":"7TFHU7VFTIHN","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7TFHU7VFTIHN2Y5V","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7TFHU7VF","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:5b0243963bbeab3a0bbb521c41687f8e65235cd9c313bbb4bccb6828690cf7f0","target":"graph","created_at":"2026-05-18T03:51:47Z","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":"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","authors_text":"Bernhard Haeupler, Chen Avin, Michael Borokhovich, Zvi Lotker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-10-02T15:18:05Z","title":"Self-Adjusting Networks to Minimize Expected Path Length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0196","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:15f1fb19be0c4de07742c8a9b5f28460126384f75226726293caf4cb3ee0b89f","target":"record","created_at":"2026-05-18T03:51:47Z","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":"e9ddcd9ad43abc00d9e2304031f2b1dc2f85552e482cb899bce8854fb6f45952","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-10-02T15:18:05Z","title_canon_sha256":"3599d130ca291db53eeb1dfd9391eb57d65471e4e0ebed4432696294e28246d2"},"schema_version":"1.0","source":{"id":"1110.0196","kind":"arxiv","version":3}},"canonical_sha256":"fcca7a7ea59a0edd63b5da97151012cbf15b7f72ae68e167fd8a08d41393c545","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcca7a7ea59a0edd63b5da97151012cbf15b7f72ae68e167fd8a08d41393c545","first_computed_at":"2026-05-18T03:51:47.270112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:47.270112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dtM2v/hwJmeIcYVw0piBHhFugRMPjARj2GjFeb9zGC0LMhO2r0bosReKKUVJS/5rbBXzmqD6ylnrRFV8zS4HBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:47.270664Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.0196","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15f1fb19be0c4de07742c8a9b5f28460126384f75226726293caf4cb3ee0b89f","sha256:5b0243963bbeab3a0bbb521c41687f8e65235cd9c313bbb4bccb6828690cf7f0"],"state_sha256":"af4102546b1a91ea40ebccbce7ef6eb40e68159e639087df6418f39fd83eb925"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"epjDW2DJRs3HK23BNtmTiziEXne6tsYavcXIWu1FP3j7dGemwyHIRH+NQ8luzw03m2vhuOIXKlTe34qFjdXdCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:26:26.568135Z","bundle_sha256":"831c042c174bcc1227887be823914d9bfd17568d034e1dad538c27d6a4c791ea"}}