{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:M5327VYCHKWDOOJB5OC225A4G4","short_pith_number":"pith:M5327VYC","canonical_record":{"source":{"id":"1301.7054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-29T20:43:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6cffae3efbbadf3b2d56bc9bdf2401000449abe5207bde0e7cb8dccaae21682e","abstract_canon_sha256":"1611464616c70cdac571b7848712668ec60d9758dd6a649c66b8f5bccf6350a5"},"schema_version":"1.0"},"canonical_sha256":"6777afd7023aac373921eb85ad741c37064cbd8cda34997e7fed93a5c1b7f06a","source":{"kind":"arxiv","id":"1301.7054","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7054","created_at":"2026-05-18T03:35:02Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7054v1","created_at":"2026-05-18T03:35:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7054","created_at":"2026-05-18T03:35:02Z"},{"alias_kind":"pith_short_12","alias_value":"M5327VYCHKWD","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M5327VYCHKWDOOJB","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M5327VYC","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:M5327VYCHKWDOOJB5OC225A4G4","target":"record","payload":{"canonical_record":{"source":{"id":"1301.7054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-29T20:43:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6cffae3efbbadf3b2d56bc9bdf2401000449abe5207bde0e7cb8dccaae21682e","abstract_canon_sha256":"1611464616c70cdac571b7848712668ec60d9758dd6a649c66b8f5bccf6350a5"},"schema_version":"1.0"},"canonical_sha256":"6777afd7023aac373921eb85ad741c37064cbd8cda34997e7fed93a5c1b7f06a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:02.766775Z","signature_b64":"casty3u5MxAtC7XnTxn9ojzgH+fq9B+coPc/na12cXe/Wi2xLn7xyMWXT6RwAsQYK0x7XpwSBxiL86rKeOegAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6777afd7023aac373921eb85ad741c37064cbd8cda34997e7fed93a5c1b7f06a","last_reissued_at":"2026-05-18T03:35:02.766002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:02.766002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.7054","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-18T03:35:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T6HQN4wHuUBvPmkN0sqVhenAcula3z4PtZI6K/bErCiOKwLTdLmXXumChQDBonNLAUpWYFkTALOCV7hI7DA6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:26:16.052602Z"},"content_sha256":"5adc40df95656afececd21b2c13b7a8bca8951ca6a6e30c113bed757ca5988c0","schema_version":"1.0","event_id":"sha256:5adc40df95656afececd21b2c13b7a8bca8951ca6a6e30c113bed757ca5988c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:M5327VYCHKWDOOJB5OC225A4G4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Repair for Distributed Storage Systems with Erasure Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Majid Gerami, Ming Xiao","submitted_at":"2013-01-29T20:43:38Z","abstract_excerpt":"We study the repair problem of distributed storage systems in erasure networks where the packets transmitted from surviving nodes to the new node might be lost. The fundamental storage-bandwidth tradeoff is calculated by multicasting analysis in erasure networks. The optimal tradeoff bound can be asymptotically achieved when the number of transmission (packets) goes to infinity. For a limited number of transmission, we study the probability of successful regenerating. Then, we investigate two approaches of increasing the probability of successful regenerating, namely, by connecting more surviv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7054","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-18T03:35:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7YePDL8JOtrjbTUOtPFvaKc3CRTvquomsfotopoqZYkg3JG9k5YF19Kdx6Hb3+yhj+klyUqVkk7qhWMjd1vGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:26:16.053234Z"},"content_sha256":"c7cc99de6b8b971e1f880fc6ccd85b58cab180b81f13f3fc5dac58520d0f95bd","schema_version":"1.0","event_id":"sha256:c7cc99de6b8b971e1f880fc6ccd85b58cab180b81f13f3fc5dac58520d0f95bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M5327VYCHKWDOOJB5OC225A4G4/bundle.json","state_url":"https://pith.science/pith/M5327VYCHKWDOOJB5OC225A4G4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M5327VYCHKWDOOJB5OC225A4G4/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-30T06:26:16Z","links":{"resolver":"https://pith.science/pith/M5327VYCHKWDOOJB5OC225A4G4","bundle":"https://pith.science/pith/M5327VYCHKWDOOJB5OC225A4G4/bundle.json","state":"https://pith.science/pith/M5327VYCHKWDOOJB5OC225A4G4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M5327VYCHKWDOOJB5OC225A4G4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:M5327VYCHKWDOOJB5OC225A4G4","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":"1611464616c70cdac571b7848712668ec60d9758dd6a649c66b8f5bccf6350a5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-29T20:43:38Z","title_canon_sha256":"6cffae3efbbadf3b2d56bc9bdf2401000449abe5207bde0e7cb8dccaae21682e"},"schema_version":"1.0","source":{"id":"1301.7054","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7054","created_at":"2026-05-18T03:35:02Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7054v1","created_at":"2026-05-18T03:35:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7054","created_at":"2026-05-18T03:35:02Z"},{"alias_kind":"pith_short_12","alias_value":"M5327VYCHKWD","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M5327VYCHKWDOOJB","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M5327VYC","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:c7cc99de6b8b971e1f880fc6ccd85b58cab180b81f13f3fc5dac58520d0f95bd","target":"graph","created_at":"2026-05-18T03:35:02Z","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":"We study the repair problem of distributed storage systems in erasure networks where the packets transmitted from surviving nodes to the new node might be lost. The fundamental storage-bandwidth tradeoff is calculated by multicasting analysis in erasure networks. The optimal tradeoff bound can be asymptotically achieved when the number of transmission (packets) goes to infinity. For a limited number of transmission, we study the probability of successful regenerating. Then, we investigate two approaches of increasing the probability of successful regenerating, namely, by connecting more surviv","authors_text":"Majid Gerami, Ming Xiao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-29T20:43:38Z","title":"Repair for Distributed Storage Systems with Erasure Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7054","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:5adc40df95656afececd21b2c13b7a8bca8951ca6a6e30c113bed757ca5988c0","target":"record","created_at":"2026-05-18T03:35:02Z","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":"1611464616c70cdac571b7848712668ec60d9758dd6a649c66b8f5bccf6350a5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-29T20:43:38Z","title_canon_sha256":"6cffae3efbbadf3b2d56bc9bdf2401000449abe5207bde0e7cb8dccaae21682e"},"schema_version":"1.0","source":{"id":"1301.7054","kind":"arxiv","version":1}},"canonical_sha256":"6777afd7023aac373921eb85ad741c37064cbd8cda34997e7fed93a5c1b7f06a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6777afd7023aac373921eb85ad741c37064cbd8cda34997e7fed93a5c1b7f06a","first_computed_at":"2026-05-18T03:35:02.766002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:02.766002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"casty3u5MxAtC7XnTxn9ojzgH+fq9B+coPc/na12cXe/Wi2xLn7xyMWXT6RwAsQYK0x7XpwSBxiL86rKeOegAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:02.766775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7054","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5adc40df95656afececd21b2c13b7a8bca8951ca6a6e30c113bed757ca5988c0","sha256:c7cc99de6b8b971e1f880fc6ccd85b58cab180b81f13f3fc5dac58520d0f95bd"],"state_sha256":"6510138290ed8993e372660026040a01c2cc8ef253177fe7f39e11b3e3a7c45a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DuDr5uf/icgMZ+Va5/hTtoHAgCkWvhrnenG9l1tGVf728/MZirVt8ZN/M0S0kxAXRjxqpPgh4kTh1G5XN/G5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:26:16.056269Z","bundle_sha256":"eff01329527dc7c171bdc953b4010ea453f3dd920721d062bbf2861056ba0c7b"}}