{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2POCDRLUEWRFS7IDMWXA7OQE6V","short_pith_number":"pith:2POCDRLU","canonical_record":{"source":{"id":"1901.02867","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-09T18:41:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b200b26ed0a7f43c2d0d4ee48794b12f86e6d08d49c8b0c318ccb7b14e5a713f","abstract_canon_sha256":"428c33b63619ece2e3452a46c407e39f64db0135e660aadb3d92f350197b4a59"},"schema_version":"1.0"},"canonical_sha256":"d3dc21c57425a2597d0365ae0fba04f55be1ef45dc118ac57a42c9eb1381d1c1","source":{"kind":"arxiv","id":"1901.02867","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02867","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02867v3","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02867","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"pith_short_12","alias_value":"2POCDRLUEWRF","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2POCDRLUEWRFS7ID","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2POCDRLU","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2POCDRLUEWRFS7IDMWXA7OQE6V","target":"record","payload":{"canonical_record":{"source":{"id":"1901.02867","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-09T18:41:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b200b26ed0a7f43c2d0d4ee48794b12f86e6d08d49c8b0c318ccb7b14e5a713f","abstract_canon_sha256":"428c33b63619ece2e3452a46c407e39f64db0135e660aadb3d92f350197b4a59"},"schema_version":"1.0"},"canonical_sha256":"d3dc21c57425a2597d0365ae0fba04f55be1ef45dc118ac57a42c9eb1381d1c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:08.904381Z","signature_b64":"f7jSOpmUe/P/hA1a7CcAdt/V48atmSrU/irZhN3oKCEECDQ4jgojSC6+w7JbjjHKoJB39E7fs0kpO4CVmZK3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3dc21c57425a2597d0365ae0fba04f55be1ef45dc118ac57a42c9eb1381d1c1","last_reissued_at":"2026-05-17T23:49:08.903736Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:08.903736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.02867","source_version":3,"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-17T23:49:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vn8KOotGum0bxxRNoQ6FqHHx+uSgO5tLvzbERQydeOc29O4A0HgNW3SiciWEBwj2jflnnA2duC76nJELZmM0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T21:37:59.096051Z"},"content_sha256":"790f73ed96220eca35688e2f6a2a809a9f58d4240c9e2b87374c9dac631a1bdf","schema_version":"1.0","event_id":"sha256:790f73ed96220eca35688e2f6a2a809a9f58d4240c9e2b87374c9dac631a1bdf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2POCDRLUEWRFS7IDMWXA7OQE6V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximally Recoverable Codes with Hierarchical Locality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aaditya M Nair, V. Lalitha","submitted_at":"2019-01-09T18:41:50Z","abstract_excerpt":"Maximally recoverable codes are a class of codes which recover from all potentially recoverable erasure patterns given the locality constraints of the code. In earlier works, these codes have been studied in the context of codes with locality. The notion of locality has been extended to hierarchical locality, which allows for locality to gradually increase in levels with the increase in the number of erasures. We consider the locality constraints imposed by codes with two-level hierarchical locality and define maximally recoverable codes with data-local and local hierarchical locality. We deri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02867","kind":"arxiv","version":3},"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-17T23:49:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uer8SjAqgw88h4GCWNR2kXEmH5/e5B0wdQX8GMloySMBM4XuHaa+AqR4sxUuD5NwLn8DzEMHWLbY8a9vc90VCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T21:37:59.096794Z"},"content_sha256":"14085aa54106c19e04d8dc3b12b5bf2190663529a8f658a22b85ebd76f610d34","schema_version":"1.0","event_id":"sha256:14085aa54106c19e04d8dc3b12b5bf2190663529a8f658a22b85ebd76f610d34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2POCDRLUEWRFS7IDMWXA7OQE6V/bundle.json","state_url":"https://pith.science/pith/2POCDRLUEWRFS7IDMWXA7OQE6V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2POCDRLUEWRFS7IDMWXA7OQE6V/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-06-09T21:37:59Z","links":{"resolver":"https://pith.science/pith/2POCDRLUEWRFS7IDMWXA7OQE6V","bundle":"https://pith.science/pith/2POCDRLUEWRFS7IDMWXA7OQE6V/bundle.json","state":"https://pith.science/pith/2POCDRLUEWRFS7IDMWXA7OQE6V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2POCDRLUEWRFS7IDMWXA7OQE6V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2POCDRLUEWRFS7IDMWXA7OQE6V","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":"428c33b63619ece2e3452a46c407e39f64db0135e660aadb3d92f350197b4a59","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-09T18:41:50Z","title_canon_sha256":"b200b26ed0a7f43c2d0d4ee48794b12f86e6d08d49c8b0c318ccb7b14e5a713f"},"schema_version":"1.0","source":{"id":"1901.02867","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02867","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02867v3","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02867","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"pith_short_12","alias_value":"2POCDRLUEWRF","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2POCDRLUEWRFS7ID","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2POCDRLU","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:14085aa54106c19e04d8dc3b12b5bf2190663529a8f658a22b85ebd76f610d34","target":"graph","created_at":"2026-05-17T23:49:08Z","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":"Maximally recoverable codes are a class of codes which recover from all potentially recoverable erasure patterns given the locality constraints of the code. In earlier works, these codes have been studied in the context of codes with locality. The notion of locality has been extended to hierarchical locality, which allows for locality to gradually increase in levels with the increase in the number of erasures. We consider the locality constraints imposed by codes with two-level hierarchical locality and define maximally recoverable codes with data-local and local hierarchical locality. We deri","authors_text":"Aaditya M Nair, V. Lalitha","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-09T18:41:50Z","title":"Maximally Recoverable Codes with Hierarchical Locality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02867","kind":"arxiv","version":3},"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:790f73ed96220eca35688e2f6a2a809a9f58d4240c9e2b87374c9dac631a1bdf","target":"record","created_at":"2026-05-17T23:49:08Z","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":"428c33b63619ece2e3452a46c407e39f64db0135e660aadb3d92f350197b4a59","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-09T18:41:50Z","title_canon_sha256":"b200b26ed0a7f43c2d0d4ee48794b12f86e6d08d49c8b0c318ccb7b14e5a713f"},"schema_version":"1.0","source":{"id":"1901.02867","kind":"arxiv","version":3}},"canonical_sha256":"d3dc21c57425a2597d0365ae0fba04f55be1ef45dc118ac57a42c9eb1381d1c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3dc21c57425a2597d0365ae0fba04f55be1ef45dc118ac57a42c9eb1381d1c1","first_computed_at":"2026-05-17T23:49:08.903736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:08.903736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f7jSOpmUe/P/hA1a7CcAdt/V48atmSrU/irZhN3oKCEECDQ4jgojSC6+w7JbjjHKoJB39E7fs0kpO4CVmZK3BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:08.904381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.02867","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:790f73ed96220eca35688e2f6a2a809a9f58d4240c9e2b87374c9dac631a1bdf","sha256:14085aa54106c19e04d8dc3b12b5bf2190663529a8f658a22b85ebd76f610d34"],"state_sha256":"2693360761e1c5773bc8e7d44d5444bf206e72401d4c1667e90adf82656a26be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EDs8f0ZnWHCoDTxoevc6je0KCIGqawRbMnr3Em+txw5AMvla342Zm8jOAZlACD5EludGRqfLXf8GmlNjCYmDBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T21:37:59.101216Z","bundle_sha256":"2cfc3da78b349e88a876b05bc68f0044a419d1348df7bf2c042a9a25281b204e"}}