{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6ATMVY5JMZ3WWNC2GONMQNHSBE","short_pith_number":"pith:6ATMVY5J","canonical_record":{"source":{"id":"1801.05989","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-18T12:50:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d35cd7d0eed91a2068de15a6eb69a33c906e295cdfacc3c35a8ed76def93266e","abstract_canon_sha256":"95759ef0184e85efd861d2c8e58fd7ad1234bb61311fd96f28da300345626ec3"},"schema_version":"1.0"},"canonical_sha256":"f026cae3a966776b345a339ac834f20929a06154ca841c1d433dc6a9bd1735ea","source":{"kind":"arxiv","id":"1801.05989","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05989","created_at":"2026-05-18T00:06:46Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05989v2","created_at":"2026-05-18T00:06:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05989","created_at":"2026-05-18T00:06:46Z"},{"alias_kind":"pith_short_12","alias_value":"6ATMVY5JMZ3W","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6ATMVY5JMZ3WWNC2","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6ATMVY5J","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6ATMVY5JMZ3WWNC2GONMQNHSBE","target":"record","payload":{"canonical_record":{"source":{"id":"1801.05989","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-18T12:50:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d35cd7d0eed91a2068de15a6eb69a33c906e295cdfacc3c35a8ed76def93266e","abstract_canon_sha256":"95759ef0184e85efd861d2c8e58fd7ad1234bb61311fd96f28da300345626ec3"},"schema_version":"1.0"},"canonical_sha256":"f026cae3a966776b345a339ac834f20929a06154ca841c1d433dc6a9bd1735ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:46.309489Z","signature_b64":"vrieRBmDbfYuLT9OC2yF+Cfu5vSW6GQWScWpsb6z3MqU1JR6Kkowx1q+lRcLBulqeA2WywtjbFD2TmXOH6riBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f026cae3a966776b345a339ac834f20929a06154ca841c1d433dc6a9bd1735ea","last_reissued_at":"2026-05-18T00:06:46.308900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:46.308900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.05989","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:06:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0tcJp89LwBnA2WE86fSsUxVP6+8XvI7lxTDnSspvuCV/jJwQcU+youBBd+m1gGVGsNyf67A/vTHDxEwscRCcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:15:49.307776Z"},"content_sha256":"2f09f47ec2eb1398cc16c991a739c169db6c5fe8b5d19fb14ee1ac36fb555055","schema_version":"1.0","event_id":"sha256:2f09f47ec2eb1398cc16c991a739c169db6c5fe8b5d19fb14ee1ac36fb555055"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6ATMVY5JMZ3WWNC2GONMQNHSBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Code Constructions for Distributed Storage With Low Repair Bandwidth and Low Repair Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Eirik Rosnes, Fredrik Br\\\"annstr\\\"om, Iryna Andriyanova, Siddhartha Kumar","submitted_at":"2018-01-18T12:50:00Z","abstract_excerpt":"We present the construction of a family of erasure correcting codes for distributed storage that achieve low repair bandwidth and complexity at the expense of a lower fault tolerance. The construction is based on two classes of codes, where the primary goal of the first class of codes is to provide fault tolerance, while the second class aims at reducing the repair bandwidth and repair complexity. The repair procedure is a two- step procedure where parts of the failed node are repaired in the first step using the first code. The downloaded symbols during the first step are cached in the memory"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05989","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:06:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fYm+qIWuw9LpVKRHauA4OpxeQpnKHLkShp3FK8zIxyi3+k44LNMsfXp/UdEj/7XNNsOLvCiVlrbi3ZGy5sJyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:15:49.308132Z"},"content_sha256":"5d00be610099f08ea2a1fbc80b06db07691e209451c5bacf41dedd41213c268a","schema_version":"1.0","event_id":"sha256:5d00be610099f08ea2a1fbc80b06db07691e209451c5bacf41dedd41213c268a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ATMVY5JMZ3WWNC2GONMQNHSBE/bundle.json","state_url":"https://pith.science/pith/6ATMVY5JMZ3WWNC2GONMQNHSBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ATMVY5JMZ3WWNC2GONMQNHSBE/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-28T08:15:49Z","links":{"resolver":"https://pith.science/pith/6ATMVY5JMZ3WWNC2GONMQNHSBE","bundle":"https://pith.science/pith/6ATMVY5JMZ3WWNC2GONMQNHSBE/bundle.json","state":"https://pith.science/pith/6ATMVY5JMZ3WWNC2GONMQNHSBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ATMVY5JMZ3WWNC2GONMQNHSBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6ATMVY5JMZ3WWNC2GONMQNHSBE","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":"95759ef0184e85efd861d2c8e58fd7ad1234bb61311fd96f28da300345626ec3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-18T12:50:00Z","title_canon_sha256":"d35cd7d0eed91a2068de15a6eb69a33c906e295cdfacc3c35a8ed76def93266e"},"schema_version":"1.0","source":{"id":"1801.05989","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05989","created_at":"2026-05-18T00:06:46Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05989v2","created_at":"2026-05-18T00:06:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05989","created_at":"2026-05-18T00:06:46Z"},{"alias_kind":"pith_short_12","alias_value":"6ATMVY5JMZ3W","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6ATMVY5JMZ3WWNC2","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6ATMVY5J","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:5d00be610099f08ea2a1fbc80b06db07691e209451c5bacf41dedd41213c268a","target":"graph","created_at":"2026-05-18T00:06:46Z","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 present the construction of a family of erasure correcting codes for distributed storage that achieve low repair bandwidth and complexity at the expense of a lower fault tolerance. The construction is based on two classes of codes, where the primary goal of the first class of codes is to provide fault tolerance, while the second class aims at reducing the repair bandwidth and repair complexity. The repair procedure is a two- step procedure where parts of the failed node are repaired in the first step using the first code. The downloaded symbols during the first step are cached in the memory","authors_text":"Alexandre Graell i Amat, Eirik Rosnes, Fredrik Br\\\"annstr\\\"om, Iryna Andriyanova, Siddhartha Kumar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-18T12:50:00Z","title":"Code Constructions for Distributed Storage With Low Repair Bandwidth and Low Repair Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05989","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:2f09f47ec2eb1398cc16c991a739c169db6c5fe8b5d19fb14ee1ac36fb555055","target":"record","created_at":"2026-05-18T00:06:46Z","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":"95759ef0184e85efd861d2c8e58fd7ad1234bb61311fd96f28da300345626ec3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-18T12:50:00Z","title_canon_sha256":"d35cd7d0eed91a2068de15a6eb69a33c906e295cdfacc3c35a8ed76def93266e"},"schema_version":"1.0","source":{"id":"1801.05989","kind":"arxiv","version":2}},"canonical_sha256":"f026cae3a966776b345a339ac834f20929a06154ca841c1d433dc6a9bd1735ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f026cae3a966776b345a339ac834f20929a06154ca841c1d433dc6a9bd1735ea","first_computed_at":"2026-05-18T00:06:46.308900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:46.308900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vrieRBmDbfYuLT9OC2yF+Cfu5vSW6GQWScWpsb6z3MqU1JR6Kkowx1q+lRcLBulqeA2WywtjbFD2TmXOH6riBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:46.309489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.05989","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f09f47ec2eb1398cc16c991a739c169db6c5fe8b5d19fb14ee1ac36fb555055","sha256:5d00be610099f08ea2a1fbc80b06db07691e209451c5bacf41dedd41213c268a"],"state_sha256":"0c92d620b4fc76ad61b4d115b47f82f3cbae286d1d63e0947787bbd25d1a11be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4IxletGpnmmGvdMzoYPRWs7dcGCR/BgLMV2B3lyV3YRSqTg+CrHAbgHQ0NY3lWRDIAtFPTBs5MJsVhD1rQObBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:15:49.310172Z","bundle_sha256":"ec5108c7b93dc62b5c1702bc843e5356ab2520e64036efeba251f8a3865d94ad"}}