{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:G7YN2I5QYPUYQWMZVHQDHKYOHQ","short_pith_number":"pith:G7YN2I5Q","canonical_record":{"source":{"id":"1509.01330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-04T02:21:30Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"e31cce6050116d7a032371664cb3c291587a9049ee0644464826b62917c89baa","abstract_canon_sha256":"ae8c6d9a14fb13edb1e6ade61778b31b7ed5693b3aa994ee765daa477696363b"},"schema_version":"1.0"},"canonical_sha256":"37f0dd23b0c3e9885999a9e033ab0e3c33819cd4991940a0d7d217234ce26ef5","source":{"kind":"arxiv","id":"1509.01330","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01330","created_at":"2026-05-18T01:33:57Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01330v1","created_at":"2026-05-18T01:33:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01330","created_at":"2026-05-18T01:33:57Z"},{"alias_kind":"pith_short_12","alias_value":"G7YN2I5QYPUY","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G7YN2I5QYPUYQWMZ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G7YN2I5Q","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:G7YN2I5QYPUYQWMZVHQDHKYOHQ","target":"record","payload":{"canonical_record":{"source":{"id":"1509.01330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-04T02:21:30Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"e31cce6050116d7a032371664cb3c291587a9049ee0644464826b62917c89baa","abstract_canon_sha256":"ae8c6d9a14fb13edb1e6ade61778b31b7ed5693b3aa994ee765daa477696363b"},"schema_version":"1.0"},"canonical_sha256":"37f0dd23b0c3e9885999a9e033ab0e3c33819cd4991940a0d7d217234ce26ef5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:57.982059Z","signature_b64":"1kpnwa5D0Z+pLo/ewePSXaQ8kNg9yeKEkYL5rQOlSZkxtoJ4k/Bol44Opf3xnTu4qWoxMphaP5UzaWruudmIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37f0dd23b0c3e9885999a9e033ab0e3c33819cd4991940a0d7d217234ce26ef5","last_reissued_at":"2026-05-18T01:33:57.981461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:57.981461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.01330","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-18T01:33:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6lyP97VbGgnCHNPO+RVYM7ly/lVrQhBQ4ek1+Lu2Rasp/dGOQMfrSQUh+JBivQwoGJwswH2objkORUpV75zSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:51:51.286405Z"},"content_sha256":"f02a86042615d4c2fe20ce79226e720f97796d0952951aa0342c548084f7cce8","schema_version":"1.0","event_id":"sha256:f02a86042615d4c2fe20ce79226e720f97796d0952951aa0342c548084f7cce8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:G7YN2I5QYPUYQWMZVHQDHKYOHQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Optimizing Replica Migration in Distributed Cloud Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Amina Mseddi, Halima Elbiaze, Mohamed Faten Zhani, Mohammad Ali Salahuddin, Roch H. Glitho","submitted_at":"2015-09-04T02:21:30Z","abstract_excerpt":"With the wide adoption of large-scale Internet services and big data, the cloud has become the ideal environment to satisfy the ever-growing storage demand, thanks to its seemingly limitless capacity, high availability and faster access time. In this context, data replication has been touted as the ultimate solution to improve data availability and reduce access time. However, replica placement systems usually need to migrate and create a large number of data replicas over time between and within data centers, incurring a large overhead in terms of network load and availability. In this paper,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01330","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-18T01:33:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dXgshsnxzZB/Oo8YPCYaGs9hbyK2u2na3bB5l93hakiA3nFlGs8fOFFWIcqKBgMiLzusGMXKcHY3qwbgNOt1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:51:51.286758Z"},"content_sha256":"fca4ceab98c6eb1f80d341cfc1e7351768aedeba511c3af2d1be0a9b673915f1","schema_version":"1.0","event_id":"sha256:fca4ceab98c6eb1f80d341cfc1e7351768aedeba511c3af2d1be0a9b673915f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G7YN2I5QYPUYQWMZVHQDHKYOHQ/bundle.json","state_url":"https://pith.science/pith/G7YN2I5QYPUYQWMZVHQDHKYOHQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G7YN2I5QYPUYQWMZVHQDHKYOHQ/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-28T08:51:51Z","links":{"resolver":"https://pith.science/pith/G7YN2I5QYPUYQWMZVHQDHKYOHQ","bundle":"https://pith.science/pith/G7YN2I5QYPUYQWMZVHQDHKYOHQ/bundle.json","state":"https://pith.science/pith/G7YN2I5QYPUYQWMZVHQDHKYOHQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G7YN2I5QYPUYQWMZVHQDHKYOHQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:G7YN2I5QYPUYQWMZVHQDHKYOHQ","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":"ae8c6d9a14fb13edb1e6ade61778b31b7ed5693b3aa994ee765daa477696363b","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-04T02:21:30Z","title_canon_sha256":"e31cce6050116d7a032371664cb3c291587a9049ee0644464826b62917c89baa"},"schema_version":"1.0","source":{"id":"1509.01330","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01330","created_at":"2026-05-18T01:33:57Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01330v1","created_at":"2026-05-18T01:33:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01330","created_at":"2026-05-18T01:33:57Z"},{"alias_kind":"pith_short_12","alias_value":"G7YN2I5QYPUY","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G7YN2I5QYPUYQWMZ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G7YN2I5Q","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:fca4ceab98c6eb1f80d341cfc1e7351768aedeba511c3af2d1be0a9b673915f1","target":"graph","created_at":"2026-05-18T01:33:57Z","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":"With the wide adoption of large-scale Internet services and big data, the cloud has become the ideal environment to satisfy the ever-growing storage demand, thanks to its seemingly limitless capacity, high availability and faster access time. In this context, data replication has been touted as the ultimate solution to improve data availability and reduce access time. However, replica placement systems usually need to migrate and create a large number of data replicas over time between and within data centers, incurring a large overhead in terms of network load and availability. In this paper,","authors_text":"Amina Mseddi, Halima Elbiaze, Mohamed Faten Zhani, Mohammad Ali Salahuddin, Roch H. Glitho","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-04T02:21:30Z","title":"On Optimizing Replica Migration in Distributed Cloud Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01330","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:f02a86042615d4c2fe20ce79226e720f97796d0952951aa0342c548084f7cce8","target":"record","created_at":"2026-05-18T01:33:57Z","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":"ae8c6d9a14fb13edb1e6ade61778b31b7ed5693b3aa994ee765daa477696363b","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-04T02:21:30Z","title_canon_sha256":"e31cce6050116d7a032371664cb3c291587a9049ee0644464826b62917c89baa"},"schema_version":"1.0","source":{"id":"1509.01330","kind":"arxiv","version":1}},"canonical_sha256":"37f0dd23b0c3e9885999a9e033ab0e3c33819cd4991940a0d7d217234ce26ef5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37f0dd23b0c3e9885999a9e033ab0e3c33819cd4991940a0d7d217234ce26ef5","first_computed_at":"2026-05-18T01:33:57.981461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:57.981461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1kpnwa5D0Z+pLo/ewePSXaQ8kNg9yeKEkYL5rQOlSZkxtoJ4k/Bol44Opf3xnTu4qWoxMphaP5UzaWruudmIAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:57.982059Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.01330","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f02a86042615d4c2fe20ce79226e720f97796d0952951aa0342c548084f7cce8","sha256:fca4ceab98c6eb1f80d341cfc1e7351768aedeba511c3af2d1be0a9b673915f1"],"state_sha256":"2ebdcb6f86d8fc211d1ae6473c543926348892cbc762a712e5eeb95c2f8bcdc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LAcRN9NSupEiRlbhEbxOV0LyfzP7oNdNfSeKiRq5Y9Y+4n/5ErpuzYsmhecdd1cYCZoQSlV8XF9IWmPr9pOMDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:51:51.288742Z","bundle_sha256":"cdaf79fd5ff9c51af2e6877540edb3c67eaa491b9b3afa42fda8f648977a64f3"}}