{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NYVJJIM5QNVYWKDHM46MQ6ZYBC","short_pith_number":"pith:NYVJJIM5","canonical_record":{"source":{"id":"1506.05579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-18T08:12:12Z","cross_cats_sorted":[],"title_canon_sha256":"3d61b748abb9d27978c9a1a1c60e4a7f4e18906f337a896de8b45a9dabaf5ec9","abstract_canon_sha256":"0437e482832d91ab4f554f8951b2a96def12e30445754244a5ff412a6a670871"},"schema_version":"1.0"},"canonical_sha256":"6e2a94a19d836b8b2867673cc87b38089bb9667b797caf1afb4ecf14dd715bce","source":{"kind":"arxiv","id":"1506.05579","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05579","created_at":"2026-05-18T01:44:10Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05579v1","created_at":"2026-05-18T01:44:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05579","created_at":"2026-05-18T01:44:10Z"},{"alias_kind":"pith_short_12","alias_value":"NYVJJIM5QNVY","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NYVJJIM5QNVYWKDH","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NYVJJIM5","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NYVJJIM5QNVYWKDHM46MQ6ZYBC","target":"record","payload":{"canonical_record":{"source":{"id":"1506.05579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-18T08:12:12Z","cross_cats_sorted":[],"title_canon_sha256":"3d61b748abb9d27978c9a1a1c60e4a7f4e18906f337a896de8b45a9dabaf5ec9","abstract_canon_sha256":"0437e482832d91ab4f554f8951b2a96def12e30445754244a5ff412a6a670871"},"schema_version":"1.0"},"canonical_sha256":"6e2a94a19d836b8b2867673cc87b38089bb9667b797caf1afb4ecf14dd715bce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:44:10.311594Z","signature_b64":"ZhMq9Y+wMFRcyNYbXVzw2V75iovCqoGcnXtXPY9ERhlni0C6e5tiNlXlYg81c4LBuNFO/igpTX9hi41Dh9pdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e2a94a19d836b8b2867673cc87b38089bb9667b797caf1afb4ecf14dd715bce","last_reissued_at":"2026-05-18T01:44:10.310853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:44:10.310853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.05579","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:44:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yDW8LtmFNssXY84a8pWT4wwcggguik/n6GvPN/M2Rl1murasNbb6glFuHcwxU14/Z+27VoOwXtEqXrhJ4LvMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:07:59.217850Z"},"content_sha256":"2b276d0fa16319e619da5d8ae41b0b4a34ac4aa3c54c2502377aa0858c09c6cd","schema_version":"1.0","event_id":"sha256:2b276d0fa16319e619da5d8ae41b0b4a34ac4aa3c54c2502377aa0858c09c6cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NYVJJIM5QNVYWKDHM46MQ6ZYBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Topology-Aware Node Selection for Data Regeneration in Heterogeneous Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dongsheng Wei, Jiaqi Wang, Jin Wang, Qingyuan Gong, Xin Wang, Yan Wang","submitted_at":"2015-06-18T08:12:12Z","abstract_excerpt":"Distributed storage systems introduce redundancy to protect data from node failures. After a storage node fails, the lost data should be regenerated at a replacement storage node as soon as possible to maintain the same level of redundancy. Minimizing such a regeneration time is critical to the reliability of distributed storage systems. Existing work commits to reduce the regeneration time by either minimizing the regenerating traffic, or adjusting the regenerating traffic patterns, whereas nodes participating data regeneration are generally assumed to be given beforehand. However, such regen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05579","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:44:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLqNLtfsgBeYGXWSc1wQDuGS5yaKsDY4cstLu2jp6oPNv3c33gtderdKTN1sYEszxaODWuTSXq25LIMZKQdyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:07:59.218193Z"},"content_sha256":"3abc45d42aefff64260c1e3975955286cdfc9e0a7186451c18f035f83d7e34c1","schema_version":"1.0","event_id":"sha256:3abc45d42aefff64260c1e3975955286cdfc9e0a7186451c18f035f83d7e34c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYVJJIM5QNVYWKDHM46MQ6ZYBC/bundle.json","state_url":"https://pith.science/pith/NYVJJIM5QNVYWKDHM46MQ6ZYBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYVJJIM5QNVYWKDHM46MQ6ZYBC/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-02T22:07:59Z","links":{"resolver":"https://pith.science/pith/NYVJJIM5QNVYWKDHM46MQ6ZYBC","bundle":"https://pith.science/pith/NYVJJIM5QNVYWKDHM46MQ6ZYBC/bundle.json","state":"https://pith.science/pith/NYVJJIM5QNVYWKDHM46MQ6ZYBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYVJJIM5QNVYWKDHM46MQ6ZYBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NYVJJIM5QNVYWKDHM46MQ6ZYBC","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":"0437e482832d91ab4f554f8951b2a96def12e30445754244a5ff412a6a670871","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-18T08:12:12Z","title_canon_sha256":"3d61b748abb9d27978c9a1a1c60e4a7f4e18906f337a896de8b45a9dabaf5ec9"},"schema_version":"1.0","source":{"id":"1506.05579","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05579","created_at":"2026-05-18T01:44:10Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05579v1","created_at":"2026-05-18T01:44:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05579","created_at":"2026-05-18T01:44:10Z"},{"alias_kind":"pith_short_12","alias_value":"NYVJJIM5QNVY","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NYVJJIM5QNVYWKDH","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NYVJJIM5","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:3abc45d42aefff64260c1e3975955286cdfc9e0a7186451c18f035f83d7e34c1","target":"graph","created_at":"2026-05-18T01:44:10Z","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":"Distributed storage systems introduce redundancy to protect data from node failures. After a storage node fails, the lost data should be regenerated at a replacement storage node as soon as possible to maintain the same level of redundancy. Minimizing such a regeneration time is critical to the reliability of distributed storage systems. Existing work commits to reduce the regeneration time by either minimizing the regenerating traffic, or adjusting the regenerating traffic patterns, whereas nodes participating data regeneration are generally assumed to be given beforehand. However, such regen","authors_text":"Dongsheng Wei, Jiaqi Wang, Jin Wang, Qingyuan Gong, Xin Wang, Yan Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-18T08:12:12Z","title":"Topology-Aware Node Selection for Data Regeneration in Heterogeneous Distributed Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05579","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:2b276d0fa16319e619da5d8ae41b0b4a34ac4aa3c54c2502377aa0858c09c6cd","target":"record","created_at":"2026-05-18T01:44:10Z","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":"0437e482832d91ab4f554f8951b2a96def12e30445754244a5ff412a6a670871","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-18T08:12:12Z","title_canon_sha256":"3d61b748abb9d27978c9a1a1c60e4a7f4e18906f337a896de8b45a9dabaf5ec9"},"schema_version":"1.0","source":{"id":"1506.05579","kind":"arxiv","version":1}},"canonical_sha256":"6e2a94a19d836b8b2867673cc87b38089bb9667b797caf1afb4ecf14dd715bce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e2a94a19d836b8b2867673cc87b38089bb9667b797caf1afb4ecf14dd715bce","first_computed_at":"2026-05-18T01:44:10.310853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:44:10.310853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZhMq9Y+wMFRcyNYbXVzw2V75iovCqoGcnXtXPY9ERhlni0C6e5tiNlXlYg81c4LBuNFO/igpTX9hi41Dh9pdBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:44:10.311594Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.05579","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b276d0fa16319e619da5d8ae41b0b4a34ac4aa3c54c2502377aa0858c09c6cd","sha256:3abc45d42aefff64260c1e3975955286cdfc9e0a7186451c18f035f83d7e34c1"],"state_sha256":"32b446d89eb7d9e9167a1d2df3fb052a5bdc511f184adda9d5ab651eda6823f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pQklx6JqRpxuDe7KuZxtJ1Ks8wnqDsjq+0X6ZCFUCBycMrV8l43qH8kXe7ibSCD/Azw8GgDECU20Us8oxCMyBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:07:59.220113Z","bundle_sha256":"d9ca86b622362f8984f8d5c5b7919bf9a0d50ad0838a3a61b383c6615bb8b038"}}