{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:V2OWHDKMBPR72CSSUYPL2QZFAG","short_pith_number":"pith:V2OWHDKM","canonical_record":{"source":{"id":"1307.6747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-07-25T14:01:26Z","cross_cats_sorted":[],"title_canon_sha256":"5756dc2df55db460cd1081a18de2112d6985cbea3eaff60845c074bcd1fa1a45","abstract_canon_sha256":"ece61247ecd3b8eaa62cbfd24e63a62fcff5e4fb833e253afa8ed2df2f602360"},"schema_version":"1.0"},"canonical_sha256":"ae9d638d4c0be3fd0a52a61ebd4325018f73cbe48d18c9a5d45a85f610722809","source":{"kind":"arxiv","id":"1307.6747","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6747","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6747v1","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6747","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"V2OWHDKMBPR7","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"V2OWHDKMBPR72CSS","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"V2OWHDKM","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:V2OWHDKMBPR72CSSUYPL2QZFAG","target":"record","payload":{"canonical_record":{"source":{"id":"1307.6747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-07-25T14:01:26Z","cross_cats_sorted":[],"title_canon_sha256":"5756dc2df55db460cd1081a18de2112d6985cbea3eaff60845c074bcd1fa1a45","abstract_canon_sha256":"ece61247ecd3b8eaa62cbfd24e63a62fcff5e4fb833e253afa8ed2df2f602360"},"schema_version":"1.0"},"canonical_sha256":"ae9d638d4c0be3fd0a52a61ebd4325018f73cbe48d18c9a5d45a85f610722809","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:34.794285Z","signature_b64":"KCvjiWIW6iqUoRPjI7/kfWgYtNwgK4myI8pVoHSxrBIV9+rO2C7rxO2w778fIm32Re57TvBTj0vTxaZzecF7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae9d638d4c0be3fd0a52a61ebd4325018f73cbe48d18c9a5d45a85f610722809","last_reissued_at":"2026-05-18T03:17:34.793660Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:34.793660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.6747","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-18T03:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ent32bYHPEsiv+8ztEqo1Nc4/TO/5q/iT0Fc+x7kuDxI6PPmt/TuxMYZ8FgWxM0C9C1+nRunmYp6q3OrKOWBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:07:45.757641Z"},"content_sha256":"78e0c4c9a46d09345e829642701912e168613cbb46b94d89db58bd1d7fe471c3","schema_version":"1.0","event_id":"sha256:78e0c4c9a46d09345e829642701912e168613cbb46b94d89db58bd1d7fe471c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:V2OWHDKMBPR72CSSUYPL2QZFAG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andreas Koutsopoulos, Christian Scheideler, Sebastian Kniesburges","submitted_at":"2013-07-25T14:01:26Z","abstract_excerpt":"We consider the problem of managing a dynamic heterogeneous storage system in a distributed way so that the amount of data assigned to a host in that system is related to its capacity. Two central problems have to be solved for this: (1) organizing the hosts in an overlay network with low degree and diameter so that one can efficiently check the correct distribution of the data and route between any two hosts, and (2) distributing the data among the hosts so that the distribution respects the capacities of the hosts and can easily be adapted as the set of hosts or their capacities change. We p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6747","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-18T03:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kMtiNyJQZZ9FXdJRmNrUl/ZQokNPcjTADx4dpERVPz+D7wrenDcse/CTeGVu3hfEoH69n6Q+QCxnobUMoI5aCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:07:45.758003Z"},"content_sha256":"ed10d35c97f0c07bb4438553191a960614a0a041f0793d153eef91aa1bbc835f","schema_version":"1.0","event_id":"sha256:ed10d35c97f0c07bb4438553191a960614a0a041f0793d153eef91aa1bbc835f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2OWHDKMBPR72CSSUYPL2QZFAG/bundle.json","state_url":"https://pith.science/pith/V2OWHDKMBPR72CSSUYPL2QZFAG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2OWHDKMBPR72CSSUYPL2QZFAG/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-28T13:07:45Z","links":{"resolver":"https://pith.science/pith/V2OWHDKMBPR72CSSUYPL2QZFAG","bundle":"https://pith.science/pith/V2OWHDKMBPR72CSSUYPL2QZFAG/bundle.json","state":"https://pith.science/pith/V2OWHDKMBPR72CSSUYPL2QZFAG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2OWHDKMBPR72CSSUYPL2QZFAG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:V2OWHDKMBPR72CSSUYPL2QZFAG","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":"ece61247ecd3b8eaa62cbfd24e63a62fcff5e4fb833e253afa8ed2df2f602360","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-07-25T14:01:26Z","title_canon_sha256":"5756dc2df55db460cd1081a18de2112d6985cbea3eaff60845c074bcd1fa1a45"},"schema_version":"1.0","source":{"id":"1307.6747","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6747","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6747v1","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6747","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"V2OWHDKMBPR7","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"V2OWHDKMBPR72CSS","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"V2OWHDKM","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:ed10d35c97f0c07bb4438553191a960614a0a041f0793d153eef91aa1bbc835f","target":"graph","created_at":"2026-05-18T03:17:34Z","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":"We consider the problem of managing a dynamic heterogeneous storage system in a distributed way so that the amount of data assigned to a host in that system is related to its capacity. Two central problems have to be solved for this: (1) organizing the hosts in an overlay network with low degree and diameter so that one can efficiently check the correct distribution of the data and route between any two hosts, and (2) distributing the data among the hosts so that the distribution respects the capacities of the hosts and can easily be adapted as the set of hosts or their capacities change. We p","authors_text":"Andreas Koutsopoulos, Christian Scheideler, Sebastian Kniesburges","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-07-25T14:01:26Z","title":"CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6747","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:78e0c4c9a46d09345e829642701912e168613cbb46b94d89db58bd1d7fe471c3","target":"record","created_at":"2026-05-18T03:17:34Z","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":"ece61247ecd3b8eaa62cbfd24e63a62fcff5e4fb833e253afa8ed2df2f602360","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-07-25T14:01:26Z","title_canon_sha256":"5756dc2df55db460cd1081a18de2112d6985cbea3eaff60845c074bcd1fa1a45"},"schema_version":"1.0","source":{"id":"1307.6747","kind":"arxiv","version":1}},"canonical_sha256":"ae9d638d4c0be3fd0a52a61ebd4325018f73cbe48d18c9a5d45a85f610722809","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae9d638d4c0be3fd0a52a61ebd4325018f73cbe48d18c9a5d45a85f610722809","first_computed_at":"2026-05-18T03:17:34.793660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:34.793660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KCvjiWIW6iqUoRPjI7/kfWgYtNwgK4myI8pVoHSxrBIV9+rO2C7rxO2w778fIm32Re57TvBTj0vTxaZzecF7Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:34.794285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.6747","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78e0c4c9a46d09345e829642701912e168613cbb46b94d89db58bd1d7fe471c3","sha256:ed10d35c97f0c07bb4438553191a960614a0a041f0793d153eef91aa1bbc835f"],"state_sha256":"29328e97371b6eed26bfdb6c8144bdb6ec82cefc54e127a9f2bd84ef3639ae6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b1KJM9CO1ZIykfV/3G65GlYwgfAKT66ByuFp4EeJw3iYlmBGuAip8UnXQx1jzFYzPGFrCa5OxrnyJwhuqKMFDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:07:45.760085Z","bundle_sha256":"935e77e9584cde3d3d42a427599007c577a4215891f07f332dee46781ffa9a2e"}}