{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:VIUAYQU7XMUUGE32NJY77RV6CY","short_pith_number":"pith:VIUAYQU7","canonical_record":{"source":{"id":"2011.01410","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2020-11-03T01:36:52Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"5d59d680b21ec7ee5cd25a7bbee71b7fb8d68af5a0dc721e3fb2458b675ffae7","abstract_canon_sha256":"ceaf77cfcb7d39ab1d8792e83fe4bdb2296c6793e84d26a67c06f7da4061725b"},"schema_version":"1.0"},"canonical_sha256":"aa280c429fbb2943137a6a71ffc6be162b1ff2aef1c457e56df9f08db1cf37bd","source":{"kind":"arxiv","id":"2011.01410","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.01410","created_at":"2026-07-05T02:30:30Z"},{"alias_kind":"arxiv_version","alias_value":"2011.01410v2","created_at":"2026-07-05T02:30:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.01410","created_at":"2026-07-05T02:30:30Z"},{"alias_kind":"pith_short_12","alias_value":"VIUAYQU7XMUU","created_at":"2026-07-05T02:30:30Z"},{"alias_kind":"pith_short_16","alias_value":"VIUAYQU7XMUUGE32","created_at":"2026-07-05T02:30:30Z"},{"alias_kind":"pith_short_8","alias_value":"VIUAYQU7","created_at":"2026-07-05T02:30:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:VIUAYQU7XMUUGE32NJY77RV6CY","target":"record","payload":{"canonical_record":{"source":{"id":"2011.01410","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2020-11-03T01:36:52Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"5d59d680b21ec7ee5cd25a7bbee71b7fb8d68af5a0dc721e3fb2458b675ffae7","abstract_canon_sha256":"ceaf77cfcb7d39ab1d8792e83fe4bdb2296c6793e84d26a67c06f7da4061725b"},"schema_version":"1.0"},"canonical_sha256":"aa280c429fbb2943137a6a71ffc6be162b1ff2aef1c457e56df9f08db1cf37bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:30:30.225581Z","signature_b64":"r95mbnrQmIttEzgF4CZacAt5ihuL+bd5ipDEAiTBYmF5thW8uRZaV8WQktcdafIcmxLQU2c3oOk6BGUy3J5bAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa280c429fbb2943137a6a71ffc6be162b1ff2aef1c457e56df9f08db1cf37bd","last_reissued_at":"2026-07-05T02:30:30.225092Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:30:30.225092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.01410","source_version":2,"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-07-05T02:30:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vFatrqnEobSjQmnbLxGZgQdw73Hs6V8KpUgem8OFGWog2HEe9Id1qNt02Ro7kFkNu9gltkFpBy6dhQQRFFLxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T22:55:50.969532Z"},"content_sha256":"939d8731fa77536b01e8e1c59b27dc42443953de6fe309245f6ed8c7b2deaacf","schema_version":"1.0","event_id":"sha256:939d8731fa77536b01e8e1c59b27dc42443953de6fe309245f6ed8c7b2deaacf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:VIUAYQU7XMUUGE32NJY77RV6CY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-level Forwarding and Scheduling Recovery Algorithm in Rapidly-changing Network for Erasure-coded Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Dan Feng, Hai Zhou, Yuchong Hu","submitted_at":"2020-11-03T01:36:52Z","abstract_excerpt":"A key design goal of erasure-coded clusters is to reduce the repair time. The existing Erasure-coded data repair schemes are roughly classified into two categories: 1. Designing rapid data repair (e.g., PPR) in a homogeneous environment. 2. Constructing data repair (e.g., PPT) based on bandwidth in a heterogeneous environment. However, these solutions are difficult to cope with the heterogeneous and Rapidly-changing network in erasure-coded clusters. To address this problem, a bandwidth-aware multi-level forwarding repair algorithm, called BMFRepair, is proposed. BMFRepair monitors the network"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.01410","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.01410/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:30:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m33+aFvoScd4Rw+CNnbjFfVN/cuGd6wqt3rAl9A/+iL+2BkhtW8mQEQLJNQgrZDcYSAJ+2aDk+YQAD1tfuSdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T22:55:50.970364Z"},"content_sha256":"3d11e19214af2726d145dc7746192a0303604b2440f19c8b4290379a7df90712","schema_version":"1.0","event_id":"sha256:3d11e19214af2726d145dc7746192a0303604b2440f19c8b4290379a7df90712"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VIUAYQU7XMUUGE32NJY77RV6CY/bundle.json","state_url":"https://pith.science/pith/VIUAYQU7XMUUGE32NJY77RV6CY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VIUAYQU7XMUUGE32NJY77RV6CY/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-07-31T22:55:50Z","links":{"resolver":"https://pith.science/pith/VIUAYQU7XMUUGE32NJY77RV6CY","bundle":"https://pith.science/pith/VIUAYQU7XMUUGE32NJY77RV6CY/bundle.json","state":"https://pith.science/pith/VIUAYQU7XMUUGE32NJY77RV6CY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VIUAYQU7XMUUGE32NJY77RV6CY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:VIUAYQU7XMUUGE32NJY77RV6CY","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":"ceaf77cfcb7d39ab1d8792e83fe4bdb2296c6793e84d26a67c06f7da4061725b","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2020-11-03T01:36:52Z","title_canon_sha256":"5d59d680b21ec7ee5cd25a7bbee71b7fb8d68af5a0dc721e3fb2458b675ffae7"},"schema_version":"1.0","source":{"id":"2011.01410","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.01410","created_at":"2026-07-05T02:30:30Z"},{"alias_kind":"arxiv_version","alias_value":"2011.01410v2","created_at":"2026-07-05T02:30:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.01410","created_at":"2026-07-05T02:30:30Z"},{"alias_kind":"pith_short_12","alias_value":"VIUAYQU7XMUU","created_at":"2026-07-05T02:30:30Z"},{"alias_kind":"pith_short_16","alias_value":"VIUAYQU7XMUUGE32","created_at":"2026-07-05T02:30:30Z"},{"alias_kind":"pith_short_8","alias_value":"VIUAYQU7","created_at":"2026-07-05T02:30:30Z"}],"graph_snapshots":[{"event_id":"sha256:3d11e19214af2726d145dc7746192a0303604b2440f19c8b4290379a7df90712","target":"graph","created_at":"2026-07-05T02:30:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.01410/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A key design goal of erasure-coded clusters is to reduce the repair time. The existing Erasure-coded data repair schemes are roughly classified into two categories: 1. Designing rapid data repair (e.g., PPR) in a homogeneous environment. 2. Constructing data repair (e.g., PPT) based on bandwidth in a heterogeneous environment. However, these solutions are difficult to cope with the heterogeneous and Rapidly-changing network in erasure-coded clusters. To address this problem, a bandwidth-aware multi-level forwarding repair algorithm, called BMFRepair, is proposed. BMFRepair monitors the network","authors_text":"Dan Feng, Hai Zhou, Yuchong Hu","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2020-11-03T01:36:52Z","title":"Multi-level Forwarding and Scheduling Recovery Algorithm in Rapidly-changing Network for Erasure-coded Clusters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.01410","kind":"arxiv","version":2},"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:939d8731fa77536b01e8e1c59b27dc42443953de6fe309245f6ed8c7b2deaacf","target":"record","created_at":"2026-07-05T02:30:30Z","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":"ceaf77cfcb7d39ab1d8792e83fe4bdb2296c6793e84d26a67c06f7da4061725b","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2020-11-03T01:36:52Z","title_canon_sha256":"5d59d680b21ec7ee5cd25a7bbee71b7fb8d68af5a0dc721e3fb2458b675ffae7"},"schema_version":"1.0","source":{"id":"2011.01410","kind":"arxiv","version":2}},"canonical_sha256":"aa280c429fbb2943137a6a71ffc6be162b1ff2aef1c457e56df9f08db1cf37bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa280c429fbb2943137a6a71ffc6be162b1ff2aef1c457e56df9f08db1cf37bd","first_computed_at":"2026-07-05T02:30:30.225092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:30:30.225092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r95mbnrQmIttEzgF4CZacAt5ihuL+bd5ipDEAiTBYmF5thW8uRZaV8WQktcdafIcmxLQU2c3oOk6BGUy3J5bAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:30:30.225581Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.01410","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:939d8731fa77536b01e8e1c59b27dc42443953de6fe309245f6ed8c7b2deaacf","sha256:3d11e19214af2726d145dc7746192a0303604b2440f19c8b4290379a7df90712"],"state_sha256":"a1e784f424d04016504489fd030e8bc37e7b530ae93da61fe5164ac06f202d39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EdVn9+uN8R8Lvme8h8RKPTLmYSlBnLcSYbdf+h4sGDW517JI2NkGhhPlI2+r8/vWMDhfU+Umo4OLf5XGs4f7BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T22:55:50.977703Z","bundle_sha256":"fc772ccdda3db8b6dc42cccbae2f0b20a8c915e8dd61f8cbbcf7f7b4774ed0a4"}}