{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IX2TMVVOOFEYYLLPBL72SIWL64","short_pith_number":"pith:IX2TMVVO","canonical_record":{"source":{"id":"1705.09555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-24T22:27:35Z","cross_cats_sorted":[],"title_canon_sha256":"6f2381de2c13a93dec31604b9e2062bf4f4c048451620a6c02b3fda48aeee974","abstract_canon_sha256":"c026a4a6cf678f4fccaa1b1d7228348df3346b30046b07fde0bb0475e6212f28"},"schema_version":"1.0"},"canonical_sha256":"45f53656ae71498c2d6f0affa922cbf7085efd34a8b4de5efb1b94c6085e7178","source":{"kind":"arxiv","id":"1705.09555","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09555","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09555v1","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09555","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"IX2TMVVOOFEY","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IX2TMVVOOFEYYLLP","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IX2TMVVO","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IX2TMVVOOFEYYLLPBL72SIWL64","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-24T22:27:35Z","cross_cats_sorted":[],"title_canon_sha256":"6f2381de2c13a93dec31604b9e2062bf4f4c048451620a6c02b3fda48aeee974","abstract_canon_sha256":"c026a4a6cf678f4fccaa1b1d7228348df3346b30046b07fde0bb0475e6212f28"},"schema_version":"1.0"},"canonical_sha256":"45f53656ae71498c2d6f0affa922cbf7085efd34a8b4de5efb1b94c6085e7178","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:38.374916Z","signature_b64":"vStAFWQdAoIstaApbgiHdeVsGxpPTjS1TBewJZ201QPGV/WlnwynXhWyCe5gbOMn7JIArBmT9Xwo6Tqpab4aBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45f53656ae71498c2d6f0affa922cbf7085efd34a8b4de5efb1b94c6085e7178","last_reissued_at":"2026-05-18T00:43:38.374528Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:38.374528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09555","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:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4VZr69ZqK57f5o35ub8R5seqEpfSfv99rFWtvSK8nSUF0MjmZzxrQLvSBL84iQtiUt+1IeTKBB3vzfiflARMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:29:02.989696Z"},"content_sha256":"ec019b6aeb4f857b35d0b48c56c5d841500e1f500bf2cbefd9f9f7632ba1503e","schema_version":"1.0","event_id":"sha256:ec019b6aeb4f857b35d0b48c56c5d841500e1f500bf2cbefd9f9f7632ba1503e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IX2TMVVOOFEYYLLPBL72SIWL64","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Concurrent self-adjusting distributed tree networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bruna Peres","submitted_at":"2017-05-24T22:27:35Z","abstract_excerpt":"SplayNets are a distributed generalization of the classic splay tree data structures. Given a set of communication requests and a network comprised of n nodes, such that any pair of nodes is capable of establishing a direct connection, the goal is to dynamically find a (locally routable) binary tree topology, which connects all nodes and optimizes the routing cost for that communication pattern, making local topology transformations (rotations) before each request is served. In this work we present a distributed and concurrent implementation of SplayNets. Analytical results show that our propo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09555","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:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xcQmKE0IB/F1KLmwrvj8+0+GKk/PQcO/7gpjYhqql9Aoc29fYSFCen6+agpZWKiTE9OpwlTOMBXbrtj4hVPPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:29:02.990044Z"},"content_sha256":"15ba3d8c06df7d5518dcbddadf11998fb2bafc9df7804529da79baa533447598","schema_version":"1.0","event_id":"sha256:15ba3d8c06df7d5518dcbddadf11998fb2bafc9df7804529da79baa533447598"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IX2TMVVOOFEYYLLPBL72SIWL64/bundle.json","state_url":"https://pith.science/pith/IX2TMVVOOFEYYLLPBL72SIWL64/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IX2TMVVOOFEYYLLPBL72SIWL64/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-08T22:29:02Z","links":{"resolver":"https://pith.science/pith/IX2TMVVOOFEYYLLPBL72SIWL64","bundle":"https://pith.science/pith/IX2TMVVOOFEYYLLPBL72SIWL64/bundle.json","state":"https://pith.science/pith/IX2TMVVOOFEYYLLPBL72SIWL64/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IX2TMVVOOFEYYLLPBL72SIWL64/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IX2TMVVOOFEYYLLPBL72SIWL64","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":"c026a4a6cf678f4fccaa1b1d7228348df3346b30046b07fde0bb0475e6212f28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-24T22:27:35Z","title_canon_sha256":"6f2381de2c13a93dec31604b9e2062bf4f4c048451620a6c02b3fda48aeee974"},"schema_version":"1.0","source":{"id":"1705.09555","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09555","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09555v1","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09555","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"IX2TMVVOOFEY","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IX2TMVVOOFEYYLLP","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IX2TMVVO","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:15ba3d8c06df7d5518dcbddadf11998fb2bafc9df7804529da79baa533447598","target":"graph","created_at":"2026-05-18T00:43:38Z","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":"SplayNets are a distributed generalization of the classic splay tree data structures. Given a set of communication requests and a network comprised of n nodes, such that any pair of nodes is capable of establishing a direct connection, the goal is to dynamically find a (locally routable) binary tree topology, which connects all nodes and optimizes the routing cost for that communication pattern, making local topology transformations (rotations) before each request is served. In this work we present a distributed and concurrent implementation of SplayNets. Analytical results show that our propo","authors_text":"Bruna Peres","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-24T22:27:35Z","title":"Concurrent self-adjusting distributed tree networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09555","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:ec019b6aeb4f857b35d0b48c56c5d841500e1f500bf2cbefd9f9f7632ba1503e","target":"record","created_at":"2026-05-18T00:43:38Z","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":"c026a4a6cf678f4fccaa1b1d7228348df3346b30046b07fde0bb0475e6212f28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-24T22:27:35Z","title_canon_sha256":"6f2381de2c13a93dec31604b9e2062bf4f4c048451620a6c02b3fda48aeee974"},"schema_version":"1.0","source":{"id":"1705.09555","kind":"arxiv","version":1}},"canonical_sha256":"45f53656ae71498c2d6f0affa922cbf7085efd34a8b4de5efb1b94c6085e7178","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45f53656ae71498c2d6f0affa922cbf7085efd34a8b4de5efb1b94c6085e7178","first_computed_at":"2026-05-18T00:43:38.374528Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:38.374528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vStAFWQdAoIstaApbgiHdeVsGxpPTjS1TBewJZ201QPGV/WlnwynXhWyCe5gbOMn7JIArBmT9Xwo6Tqpab4aBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:38.374916Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09555","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec019b6aeb4f857b35d0b48c56c5d841500e1f500bf2cbefd9f9f7632ba1503e","sha256:15ba3d8c06df7d5518dcbddadf11998fb2bafc9df7804529da79baa533447598"],"state_sha256":"988393d0a13c25eff9934b8f79b8a38a905d4e31cbe02b3ccf9264e0f8565172"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"50PcxJAF5cVbRdhKfEEg8k/7Ic6BQjk/LU93e7EUG0edIWgGGM7550dd0ehfuQbnchibLUqLd/zDPy0Frj7sCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:29:02.991933Z","bundle_sha256":"24772d2bce76040ed9cf23881dc57acd3c82178ed9401fc9931774f6ac02e374"}}