{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CENDMM3FNGDWZTMEOQ7IFNSAGW","short_pith_number":"pith:CENDMM3F","canonical_record":{"source":{"id":"1605.05412","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-18T01:17:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3064b70a36b111b9796574dcf7662701f31f7f94413f1a9f84c05e71f97727a2","abstract_canon_sha256":"532595f88289ed931e2517a801da19759ef5f9cf0ccce9984fa9400f88289bd0"},"schema_version":"1.0"},"canonical_sha256":"111a36336569876ccd84743e82b64035aeeb4394372c8a668ad48d1cd610b152","source":{"kind":"arxiv","id":"1605.05412","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05412","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05412v4","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05412","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"pith_short_12","alias_value":"CENDMM3FNGDW","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CENDMM3FNGDWZTME","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CENDMM3F","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CENDMM3FNGDWZTMEOQ7IFNSAGW","target":"record","payload":{"canonical_record":{"source":{"id":"1605.05412","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-18T01:17:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3064b70a36b111b9796574dcf7662701f31f7f94413f1a9f84c05e71f97727a2","abstract_canon_sha256":"532595f88289ed931e2517a801da19759ef5f9cf0ccce9984fa9400f88289bd0"},"schema_version":"1.0"},"canonical_sha256":"111a36336569876ccd84743e82b64035aeeb4394372c8a668ad48d1cd610b152","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:09.031483Z","signature_b64":"x2jrm58IAcGQRqnReEcKpCG0x6x3H0VPxRhGe2/Au+feaBibtXocwFKrn7DN6d8LFM/PtxdD3HKQ24/ITTApDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"111a36336569876ccd84743e82b64035aeeb4394372c8a668ad48d1cd610b152","last_reissued_at":"2026-05-18T01:04:09.030885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:09.030885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.05412","source_version":4,"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-18T01:04:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4W9KlW0dxmWJztkJVe4nY/EdPgBoIwWKknADyM6lH2fYrsATrIoiR/6G+FH0ST9VJjzpULVmRady39Jg5r1PAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T21:01:05.500883Z"},"content_sha256":"c7bad8e79655e02b35494e6d7fb7ff2d5fb1602f7430358f8d16a16f96207ff8","schema_version":"1.0","event_id":"sha256:c7bad8e79655e02b35494e6d7fb7ff2d5fb1602f7430358f8d16a16f96207ff8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CENDMM3FNGDWZTMEOQ7IFNSAGW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximally Recoverable Codes for Grid-like Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Carol Wang, Guangda Hu, Parikshit Gopalan, Sergey Yekhanin, Shubhangi Saraf, Swastik Kopparty","submitted_at":"2016-05-18T01:17:23Z","abstract_excerpt":"The explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Yet, the codes being deployed in practice are fairly short. In this work, we address what we view as the main coding theoretic barrier to deploying longer codes in storage: at large lengths, failures are not independent and correlated failures are inevitable. This motivates designing codes that allow quick data recovery even after large correlated failures, and which have efficient encoding and decoding. We propose that code design for distributed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05412","kind":"arxiv","version":4},"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-18T01:04:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DaYOrfm8/GEgNCax85RjEIZgN30hbMH7X7UTGZIUXOtu4wEuPQRLyIVYUOZj9GLQEzIew6lkmu8cU5nt97m+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T21:01:05.501233Z"},"content_sha256":"5938a53cae38e450796623f15502b061bdaecae3e0f061c88dceed1c01d49e7c","schema_version":"1.0","event_id":"sha256:5938a53cae38e450796623f15502b061bdaecae3e0f061c88dceed1c01d49e7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CENDMM3FNGDWZTMEOQ7IFNSAGW/bundle.json","state_url":"https://pith.science/pith/CENDMM3FNGDWZTMEOQ7IFNSAGW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CENDMM3FNGDWZTMEOQ7IFNSAGW/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-20T21:01:05Z","links":{"resolver":"https://pith.science/pith/CENDMM3FNGDWZTMEOQ7IFNSAGW","bundle":"https://pith.science/pith/CENDMM3FNGDWZTMEOQ7IFNSAGW/bundle.json","state":"https://pith.science/pith/CENDMM3FNGDWZTMEOQ7IFNSAGW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CENDMM3FNGDWZTMEOQ7IFNSAGW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CENDMM3FNGDWZTMEOQ7IFNSAGW","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":"532595f88289ed931e2517a801da19759ef5f9cf0ccce9984fa9400f88289bd0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-18T01:17:23Z","title_canon_sha256":"3064b70a36b111b9796574dcf7662701f31f7f94413f1a9f84c05e71f97727a2"},"schema_version":"1.0","source":{"id":"1605.05412","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05412","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05412v4","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05412","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"pith_short_12","alias_value":"CENDMM3FNGDW","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CENDMM3FNGDWZTME","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CENDMM3F","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:5938a53cae38e450796623f15502b061bdaecae3e0f061c88dceed1c01d49e7c","target":"graph","created_at":"2026-05-18T01:04:09Z","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":"The explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Yet, the codes being deployed in practice are fairly short. In this work, we address what we view as the main coding theoretic barrier to deploying longer codes in storage: at large lengths, failures are not independent and correlated failures are inevitable. This motivates designing codes that allow quick data recovery even after large correlated failures, and which have efficient encoding and decoding. We propose that code design for distributed ","authors_text":"Carol Wang, Guangda Hu, Parikshit Gopalan, Sergey Yekhanin, Shubhangi Saraf, Swastik Kopparty","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-18T01:17:23Z","title":"Maximally Recoverable Codes for Grid-like Topologies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05412","kind":"arxiv","version":4},"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:c7bad8e79655e02b35494e6d7fb7ff2d5fb1602f7430358f8d16a16f96207ff8","target":"record","created_at":"2026-05-18T01:04:09Z","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":"532595f88289ed931e2517a801da19759ef5f9cf0ccce9984fa9400f88289bd0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-18T01:17:23Z","title_canon_sha256":"3064b70a36b111b9796574dcf7662701f31f7f94413f1a9f84c05e71f97727a2"},"schema_version":"1.0","source":{"id":"1605.05412","kind":"arxiv","version":4}},"canonical_sha256":"111a36336569876ccd84743e82b64035aeeb4394372c8a668ad48d1cd610b152","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"111a36336569876ccd84743e82b64035aeeb4394372c8a668ad48d1cd610b152","first_computed_at":"2026-05-18T01:04:09.030885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:09.030885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x2jrm58IAcGQRqnReEcKpCG0x6x3H0VPxRhGe2/Au+feaBibtXocwFKrn7DN6d8LFM/PtxdD3HKQ24/ITTApDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:09.031483Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05412","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7bad8e79655e02b35494e6d7fb7ff2d5fb1602f7430358f8d16a16f96207ff8","sha256:5938a53cae38e450796623f15502b061bdaecae3e0f061c88dceed1c01d49e7c"],"state_sha256":"b4c9b4cb3b43f0222e22356ee6c1089b975a54226d3b41a5b7170262544ef6ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2pLzmJWtU9BKjkbgiMnLX4FpfID1l2EwJokV3Jl1I+35l8o7ra+n4qfI3Au4HEE5cKj4U+fk//fU38ALsy3KCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T21:01:05.503258Z","bundle_sha256":"a37c6f696b30b2cc764a128dfa106ac67c4bc71b4e89efae0ba7f7ca68db5e22"}}