{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:B2DIJIC3QKHKJGBBY2J3JC7AEB","short_pith_number":"pith:B2DIJIC3","canonical_record":{"source":{"id":"1706.05431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-16T21:08:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"87d20eb23e48a1dbc2704f5c531b3e20b583a234ae797cde78a6d04c41c23d9e","abstract_canon_sha256":"b44e0fb256ad62e36393d8988f485ecd3d3069f87e5d715d2d0366e204d67227"},"schema_version":"1.0"},"canonical_sha256":"0e8684a05b828ea49821c693b48be02066552874c1f3a5818b4188b7b1ede2e7","source":{"kind":"arxiv","id":"1706.05431","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05431","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05431v2","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05431","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"pith_short_12","alias_value":"B2DIJIC3QKHK","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B2DIJIC3QKHKJGBB","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B2DIJIC3","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:B2DIJIC3QKHKJGBBY2J3JC7AEB","target":"record","payload":{"canonical_record":{"source":{"id":"1706.05431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-16T21:08:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"87d20eb23e48a1dbc2704f5c531b3e20b583a234ae797cde78a6d04c41c23d9e","abstract_canon_sha256":"b44e0fb256ad62e36393d8988f485ecd3d3069f87e5d715d2d0366e204d67227"},"schema_version":"1.0"},"canonical_sha256":"0e8684a05b828ea49821c693b48be02066552874c1f3a5818b4188b7b1ede2e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:36.959995Z","signature_b64":"tiQGMLnkkwqnUozJqx5w4LKUcLfYgLaV4NfYZJ1ySzDMI+2jiAZajd3mkF6DTD8xFoG0czXgpIgh/IHay+wXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e8684a05b828ea49821c693b48be02066552874c1f3a5818b4188b7b1ede2e7","last_reissued_at":"2026-05-18T00:16:36.959387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:36.959387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.05431","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-05-18T00:16:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PvOqXZu8Rfd71ZYr1E7SsBA/wfLFJCAlATXJbZ2pFPlpfxXxC/SeZ0yum8qfvtuOXJYkxf08ASd4YjnInvSDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:56:20.103184Z"},"content_sha256":"71ea1604b298cf7693d5ace1e1f8dcb7220f1f028cd7221fda7ef201ac358444","schema_version":"1.0","event_id":"sha256:71ea1604b298cf7693d5ace1e1f8dcb7220f1f028cd7221fda7ef201ac358444"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:B2DIJIC3QKHKJGBBY2J3JC7AEB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Centralized Multi-Node Repair Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marwen Zorgui, Zhiying Wang","submitted_at":"2017-06-16T21:08:02Z","abstract_excerpt":"In a distributed storage system, recovering from multiple failures is a critical and frequent task that is crucial for maintaining the system's reliability and fault-tolerance. In this work, we focus on the problem of repairing multiple failures in a centralized way, which can be desirable in many data storage configurations, and we show that a significant repair traffic reduction is possible. First, the fundamental tradeoff between the repair bandwidth and the storage size for functional repair is established. Using a graph-theoretic formulation, the optimal tradeoff is identified as the solu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05431","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":""},"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-18T00:16:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BYU0zGV52yQGT85fcJRMtWUfCGUCcy2vPI0QEUivPAqagcydAv76l9dWpkNotkhNm2sQy0CTOGdjApDc7UFVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:56:20.104084Z"},"content_sha256":"e434830b61bc518cf95a8e771760970d76b25ba243a868a63275ab46d407dbfa","schema_version":"1.0","event_id":"sha256:e434830b61bc518cf95a8e771760970d76b25ba243a868a63275ab46d407dbfa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2DIJIC3QKHKJGBBY2J3JC7AEB/bundle.json","state_url":"https://pith.science/pith/B2DIJIC3QKHKJGBBY2J3JC7AEB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2DIJIC3QKHKJGBBY2J3JC7AEB/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-30T10:56:20Z","links":{"resolver":"https://pith.science/pith/B2DIJIC3QKHKJGBBY2J3JC7AEB","bundle":"https://pith.science/pith/B2DIJIC3QKHKJGBBY2J3JC7AEB/bundle.json","state":"https://pith.science/pith/B2DIJIC3QKHKJGBBY2J3JC7AEB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2DIJIC3QKHKJGBBY2J3JC7AEB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:B2DIJIC3QKHKJGBBY2J3JC7AEB","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":"b44e0fb256ad62e36393d8988f485ecd3d3069f87e5d715d2d0366e204d67227","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-16T21:08:02Z","title_canon_sha256":"87d20eb23e48a1dbc2704f5c531b3e20b583a234ae797cde78a6d04c41c23d9e"},"schema_version":"1.0","source":{"id":"1706.05431","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05431","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05431v2","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05431","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"pith_short_12","alias_value":"B2DIJIC3QKHK","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B2DIJIC3QKHKJGBB","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B2DIJIC3","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:e434830b61bc518cf95a8e771760970d76b25ba243a868a63275ab46d407dbfa","target":"graph","created_at":"2026-05-18T00:16:36Z","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":"In a distributed storage system, recovering from multiple failures is a critical and frequent task that is crucial for maintaining the system's reliability and fault-tolerance. In this work, we focus on the problem of repairing multiple failures in a centralized way, which can be desirable in many data storage configurations, and we show that a significant repair traffic reduction is possible. First, the fundamental tradeoff between the repair bandwidth and the storage size for functional repair is established. Using a graph-theoretic formulation, the optimal tradeoff is identified as the solu","authors_text":"Marwen Zorgui, Zhiying Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-16T21:08:02Z","title":"Centralized Multi-Node Repair Regenerating Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05431","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:71ea1604b298cf7693d5ace1e1f8dcb7220f1f028cd7221fda7ef201ac358444","target":"record","created_at":"2026-05-18T00:16:36Z","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":"b44e0fb256ad62e36393d8988f485ecd3d3069f87e5d715d2d0366e204d67227","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-16T21:08:02Z","title_canon_sha256":"87d20eb23e48a1dbc2704f5c531b3e20b583a234ae797cde78a6d04c41c23d9e"},"schema_version":"1.0","source":{"id":"1706.05431","kind":"arxiv","version":2}},"canonical_sha256":"0e8684a05b828ea49821c693b48be02066552874c1f3a5818b4188b7b1ede2e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e8684a05b828ea49821c693b48be02066552874c1f3a5818b4188b7b1ede2e7","first_computed_at":"2026-05-18T00:16:36.959387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:36.959387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tiQGMLnkkwqnUozJqx5w4LKUcLfYgLaV4NfYZJ1ySzDMI+2jiAZajd3mkF6DTD8xFoG0czXgpIgh/IHay+wXAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:36.959995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05431","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71ea1604b298cf7693d5ace1e1f8dcb7220f1f028cd7221fda7ef201ac358444","sha256:e434830b61bc518cf95a8e771760970d76b25ba243a868a63275ab46d407dbfa"],"state_sha256":"3cdde2e61fda2a38c133f30d98c2e52e5c58b7f2d3be3cd71aa44a32c953333b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owrJaq/UUErszKRu45HBU+XduU9pv5+HPsqHg2jRGXliRtgsRR6ISjF3QaaExDM1fyXyscDrmiBtKICWQci/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:56:20.108892Z","bundle_sha256":"e93ed305b11038465f61fb15bdc057f53cac0fd015b8d2bc18aa87adaa779168"}}