{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:VIUAYQU7XMUUGE32NJY77RV6CY","short_pith_number":"pith:VIUAYQU7","schema_version":"1.0","canonical_sha256":"aa280c429fbb2943137a6a71ffc6be162b1ff2aef1c457e56df9f08db1cf37bd","source":{"kind":"arxiv","id":"2011.01410","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2011.01410","created_at":"2026-07-05T02:30:30.225146+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.01410v2","created_at":"2026-07-05T02:30:30.225146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.01410","created_at":"2026-07-05T02:30:30.225146+00:00"},{"alias_kind":"pith_short_12","alias_value":"VIUAYQU7XMUU","created_at":"2026-07-05T02:30:30.225146+00:00"},{"alias_kind":"pith_short_16","alias_value":"VIUAYQU7XMUUGE32","created_at":"2026-07-05T02:30:30.225146+00:00"},{"alias_kind":"pith_short_8","alias_value":"VIUAYQU7","created_at":"2026-07-05T02:30:30.225146+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VIUAYQU7XMUUGE32NJY77RV6CY","json":"https://pith.science/pith/VIUAYQU7XMUUGE32NJY77RV6CY.json","graph_json":"https://pith.science/api/pith-number/VIUAYQU7XMUUGE32NJY77RV6CY/graph.json","events_json":"https://pith.science/api/pith-number/VIUAYQU7XMUUGE32NJY77RV6CY/events.json","paper":"https://pith.science/paper/VIUAYQU7"},"agent_actions":{"view_html":"https://pith.science/pith/VIUAYQU7XMUUGE32NJY77RV6CY","download_json":"https://pith.science/pith/VIUAYQU7XMUUGE32NJY77RV6CY.json","view_paper":"https://pith.science/paper/VIUAYQU7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.01410&json=true","fetch_graph":"https://pith.science/api/pith-number/VIUAYQU7XMUUGE32NJY77RV6CY/graph.json","fetch_events":"https://pith.science/api/pith-number/VIUAYQU7XMUUGE32NJY77RV6CY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VIUAYQU7XMUUGE32NJY77RV6CY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VIUAYQU7XMUUGE32NJY77RV6CY/action/storage_attestation","attest_author":"https://pith.science/pith/VIUAYQU7XMUUGE32NJY77RV6CY/action/author_attestation","sign_citation":"https://pith.science/pith/VIUAYQU7XMUUGE32NJY77RV6CY/action/citation_signature","submit_replication":"https://pith.science/pith/VIUAYQU7XMUUGE32NJY77RV6CY/action/replication_record"}},"created_at":"2026-07-05T02:30:30.225146+00:00","updated_at":"2026-07-05T02:30:30.225146+00:00"}